 Bell Numbers
##### Submissions: 579   Accuracy: 22.41%   Difficulty: Easy   Marks: 2

Given a set of n elements, find number of ways of partitioning it.

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:

Print the number of ways of partitioning n elements. Since the value can be quite large print the value modulo 109+7 for each test case in a new line.

Constraints:

1<= T <=100

1<= N <=1000

Example:

```Input:  n = 2
Output: Number of ways = 2
Explanation: Let the set be {1, 2}
{ {1}, {2} }
{ {1, 2} }

Input:  n = 3
Output: Number of ways = 5
Explanation: Let the set be {1, 2, 3}
{ {1}, {2}, {3} }
{ {1}, {2, 3} }
{ {2}, {1, 3} }
{ {3}, {1, 2} }
{ {1, 2, 3} }. ```

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