 Timer is Running

Ways to write n as sum
##### Submissions: 1994   Accuracy: 22.97%   Difficulty: Easy   Marks: 2

Given a positive integer N, the task is to find the number of different ways in which N can be written as a sum of two or more positive integers.

Input:
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:
For each testcase, in a new line, 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.

Constraints:
1 <= T <= 100
1 <= N <= 103

Example:
Input:
2
5
3
Output:
6
2

Explanation:
Testcase1:

5:
1+1+1+1+1
1+1+1+2
1+1+3
1+4
2+1+2
2+3
So, a total of 6 ways.

#### ** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Sujnesh Mishra
Author: sujnesh

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.