a sequence x1 x2 xn fibonaccilike ifn 3xi xi1 xi2 2 nGiven strictly increase array arr positive integer form sequence return length long fibonaccilike subsequence arr if exist return 0A subsequence derive sequence arr delete number element include arr change order remain element for example 3 5 8 subsequence 3 4 5 6 7 8 Example 1input arr 12345678output 5explanation the long subsequence fibonaccilike 12358example 2input arr 13711121418output 3explanation the long subsequence fibonaccilike 11112 31114 71118 Constraints3 arrlength 10001 arri arri 1 109