f[n][m]表示n张卡分成m组的种类数,那么f[n][m]=f[n-1][m-1]+f[n-1][m]*m,
而ans[n]=sum{f[n][l]}(1<=l<=m)。
其中:f[n-1][m-1]代表第n个人自成一堆;
而ans[n]=sum{f[n][l]}(1<=l<=m)。
其中:f[n-1][m-1]代表第n个人自成一堆;
f[n-1][m]*m代表第n个人不自成一堆。
// Created by Chenhongwei in 2015.
// Copyright (c) 2015 Chenhongwei. All rights reserved.
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <sstream>
#include <algorithm>
using namespace std;
const int inf=1e9;
const int maxn=1e5+100;
typedef long long ll;
typedef unsigned long long ull;
int f[2020][2020];
int ans[2020];
void work()
{
memset(f,0,sizeof f);
memset(ans,0,sizeof ans);
f[1][1]=1,ans[1]=1;
for(int i=2;i<=2000;i++)
{
for(int j=1;j<=i;j++)
{
f[i][j]=(f[i-1][j-1]+f[i-1][j]*j)%1000;
ans[i]+=f[i][j];
}
ans[i]%=1000;
}
}
int main()
{
//ios::sync_with_stdio(false);
// freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int T,n;
work();
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
cout<<ans[n]<<endl;
}
return 0;
}