Given two integer sequences A = {a[1], a[2], …, a[n]} and B = {b[1], b[2], …, b[n]}, the sum-sequence of A and B is {a[1] + b[1], a[1] + b[2], …, a[2] + b[1], …, a[n] + b[n]} which are generated by picking one element a[i] in A and other element b[j] in B and adding them to get a new element of the sum-sequence. If all the numbers in sum-sequence are different and can be found from 1 to n * n, then we call (A, B) n-th sequence pair.

Now given a number n, calculate the numbers of n-th sequence pair. Notice that pair (A, B) is equal to (B, A). If all elements in A increase by a constant and all elements in B decrease by the same constant, we also think the resulted pair is equivalent to the original pair. For these reasons, we require that the smallest number in A must be 0 and the smallest number in B must be 1.