#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
signed main() {
    auto fp = [&](int a, int n, int mod) {
        int res = 1;
        while (n) {if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1;}
        return res;
    };
    auto inv = [&](int x) {
        return fp(x, mod - 2, mod);
    };
    int tt; cin >> tt;
    while (tt--) {
        int n; cin >> n;
        vector<int> jc(n + 5), invv(n + 5);
        jc[0] = 1;
        invv[0] = 1;
        for (int i = 1; i <= n; i++) {
            jc[i] = jc[i - 1] * i % mod;
            invv[i] = inv(jc[i]);
        }
        vector<int> B(n + 5);
        B[0] = 1;
        auto C = [&](int big, int sml) {
            return jc[big] * invv[sml] % mod * invv[big - sml] % mod;
        };
        for (int i = 1; i <= n; i++) {
            for (int k = 0; k < i; k++) {
                B[i] = (C(i - 1, k) * B[k] % mod + B[i] % mod) % mod;
            }
        }
        cout << B[n] << '\n';
    }
    return 0;
}