Hikaru, Touya and Waya

The title of the problem has nothing to do with the problem. You are given an integer N and an array C of positive integers of size N.Is there a weighted graph with positive integer weights on N vertices such that sum of weights of edges adjacent to vertex i is C[i] and weight of edge between i and j is at most i bitwise-xor j Input First line contains T, the number of test cases. Each test case