For a given number n > 0, find the number of different ways in which n can be written as a sum of at two or more positive integers.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the integer N.
Output the number of ways N can be written as the sum of two or more positive integers for each test case in a new line. Since the answer can be quite large print the answer modulo 109+7.
1<= T <=100
1<= N <=1000