#include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>#include <cmath>#include <algorithm>#define Mod 1000000007#define ll long longusing namespace std;#define N 100002ll ans[N];struct node {    int n,ind;}a[N];int cmp(node ka,node kb) { return ka.n < kb.n; }int main(){    int tot = 0,i,n;    while(scanf("%d",&n)!=EOF)    {        a[++tot].n = n;        a[tot].ind = tot;    }    sort(a+1,a+tot+1,cmp);    ll fac = 1, f = 1;    int j = 1;    for(i=1;i<=tot;i++)    {        while(j <= a[i].n)        {            fac = fac*j%Mod;            f = f*fac%Mod;            j++;        }        ans[a[i].ind] = f;    }    for(i=1;i<=tot;i++)        cout<<ans[i]<<endl;    return 0;}