it easy version problem the difference version a_i le 200you give array n integer a_0 a_1 a_2 ldot a_n 1 Bryap wants find long beautiful subsequence arrayAn array b b_0 b_1 ldot b_m1 0 le b_0 b_1 ldot b_m 1 n subsequence length m array aSubsequence b b_0 b_1 ldot b_m1 length m call beautiful follow condition hold for p 0 le p m 1 hold a_b_p oplus b_p1 a_b_p1 oplus b_p here oplus b denote bitwise XOR b for example 2 oplus 4 6 3 oplus 12Bryap simple person want know length long subsequence help bryap find answer question