There are People, -th person wants to be friend with all the person between .
A friendship is possible between two distinct person if and only if both of them wants to be friends with each other i.e, -th and -th person can be friend only if and .
Print the total number of possible friendship.
Input format
Output format
For each test case print the total number of possible friendship in a separate line.
Constraints
The sum of over all test cases does not exceed
Friendship is only possible between , and .