Partition the numbers

You are given two integers x and N. Consider all integers between 1 and N inclusive, except x. We want to partition these integers into two disjoint sets (each integer has to appear in exactly one set) such that the sums of numbers in these sets are equal. Find one valid partition or determine that it doesn't exist. Input - The first line of the input contains a single integer T denoting the nu