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 10 ^{9}+7**.

**Constraints:**

1 <= T <= 100

1 <= N <= 10^{3}

**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.

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.

bhatabhi554 | 317 |

hardikJain5 | 306 |

CodeBuddy | 293 |

Akkki111 | 233 |

clone | 230 |

KshatriyaYash | 1932 |

nikhil_sojan | 1374 |

lonecoder | 1236 |

mazumderrohit8 | 1176 |

RemoveTLE | 1144 |

blackshadows | 5327 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4605 |

Quandray | 4444 |

Login to report an issue on this page.