[HackerEarth] You will be given a number n- number of distinguishable objects. Your task is to calculate the number of ways that n objects can be grouped into sets if no set can be empty. - P18582

P18582 [HackerEarth] You will be given a number n- number of distinguishable objects. Your task is to calculate the number of ways that n objects can be grouped into sets if no set can be empty.

普及

题目描述

You will be given a number n- number of distinguishable objects. Your task is to calculate the number of ways that n objects can be grouped into sets if no set can be empty.
For example, the letters AB can be grouped into following sets- {(AB)} and {(A), (B)}. Thus, for n=2 the answer is 2.

Another eg:- the letters can be ABC can be grouped into following sets-
{ (ABC) },
{ (AB) , (C) },
{ (AC) , (B) },
{ (BC) , (A) },
{ (A) , (B) , (C)}.

Thus the answer is 5.

Since the answer could be very large, output it modulo 1000000007.

Input :
The first line of the input contains an integer T (1 ≤ T ≤ 500), the number of test cases. Then T test cases follow. Each test case consists of a line which contains a positive integer, n (1 ≤ n ≤ 500).

Output :
Output the answer as per the constraints given in the problem statement.

SAMPLE INPUT
3
1
2
3

SAMPLE OUTPUT
1
2
5

输入格式

见题面

输出格式

见题面

样例输入

样例输出

题目信息

时间限制	2000 ms
内存限制	256 MB
难度	普及
提交数	0
通过数	0
通过率	0.0%

登录后 AI 解题查看题解登录后提交