B'You are given n integers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an. Denote this list of integers as T. Let f(L) be a function that takes in a non-empty list of integers L. The function will output another integer as follows: For example f(10, xe2 x80 x899) xe2 x80 x89= xe2 x80 x890, f(123, xe2 x80 x89321) xe2 x80 x89= xe2 x80 x89121, f(530, xe2 x80 x89932, xe2 x80 x8981) xe2 x80 x89= xe2 x80 x8930. Define the function In other words, G(x) is the sum of squares of sum of elements of nonempty subsequences of T that evaluate to x when plugged into f modulo 1 xe2 x80 x89000 xe2 x80 x89000 xe2 x80 x89007, then multiplied by x. The last multiplication is not modded. You would like to compute G(0), xe2 x80 x89G(1), xe2 x80 x89..., xe2 x80 x89G(999 xe2 x80 x89999). To reduce the output size, print the value , where denotes the bitwise XOR operator. The first line contains the integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891 xe2 x80 x89000 xe2 x80 x89000) -- the size of list T. The next line contains n space-separated integers, a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an (0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89999 xe2 x80 x89999) -- the elements of the list. Output a single integer, the answer to the problem. For the first sample, the nonzero values of G are G(121) xe2 x80 x89= xe2 x80 x89144 xe2 x80 x89611 xe2 x80 x89577, G(123) xe2 x80 x89= xe2 x80 x8958 xe2 x80 x89401 xe2 x80 x89999, G(321) xe2 x80 x89= xe2 x80 x89279 xe2 x80 x89403 xe2 x80 x89857, G(555) xe2 x80 x89= xe2 x80 x89170 xe2 x80 x89953 xe2 x80 x89875. The bitwise XOR of these numbers is equal to 292 xe2 x80 x89711 xe2 x80 x89924. For example, , since the subsequences [123] and [123, xe2 x80 x89555] evaluate to 123 when plugged into f. For the second sample, we have For the last sample, we have , where is the binomial coefficient. '...