Gaitonde find ways

You are given $n$ points. All these points lie on a circle. All you have to return is the no of ways joining 2 non-adjacent points on the circle. ###Input: - The first line contains a single integer ,$T$ , no of test cases. Each of next $T$ lines is a single integer $N$, denoting the no. of points on the circle. ###Output: - For each test case, return the required answer on new line . ###Co