数论专题hdu2674

#include <iostream>
using namespace std;
const int mod = 2009;
typedef long long ll;
ll J[41];
void Je(){
        J[0] = J[1] = 1;
        for(int i=2;i<=40;i++){
                J[i] = J[i-1] * i % mod;
        }
}

int main(){
        int n;
        Je();
        while(cin >> n){
                if(n < 41)cout << J[n] << endl;
                else cout << 0 << endl;
        }
        return 0;
}