#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<set>

 #include<cmath>

 using namespace std;

 const int maxn = 1e4 + ;

 typedef long long ll;

 ll T, n, m;

 ll a[maxn];

 int main()

 {

     a[] = ;

     for(int i = ; i <= ; i++)

     {

         a[i] = a[i - ] * i % ;

     }

     while(cin >> n)

     {

         if(n >= )cout<<""<<endl;

         else cout<<a[n]<<endl;

     }

     return ;

 }