#include <bits/stdc++.h>

using namespace std;

typedef long long ll ;

typedef set<pair<int,int>> spi;

typedef set<pair<ll,ll>> spl;

typedef vector<pair<int,int>> vpi;

typedef vector<int> vi;

typedef vector<ll> vl;

typedef vector<bool> vb;

typedef vector<char> vc;

typedef vector<pair<ll,ll>> vpl;

typedef vector<string> vs;

typedef map<int,int>mi;

typedef map<ll,ll> ml;

typedef set<string> ss;

typedef set<char>sc;

typedef set<int> si;

typedef set<ll> sl;

#define pan cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);

#define mod 1000000007

#define phi 1.618

#define get_set_bits(a) (__builtin_popcount(a))

#define get_set_bitsll(a) ( __builtin_popcountll(a))

#define get_trail_zero(a) (__builtin_ctz(a))

#define get_lead_zero(a) (__builtin_clz(a))

#define get_parity(a) (__builtin_parity(a))

#define ff first

#define ss second

#define mp make_pair

#define line cout<<endl;

#define pb push_back

#define Endl "\n"

#define loop(i,start,end) for(ll i=ll(start);i<ll(end);i++)

#define loop0(num) for(ll i=0;i<ll(num);i++)

#define forin(arr,n) for(ll i=0;i<n;i++) cin>>arr[i];

#define no cout<<"NO"<<endl;

#define yes cout<<"YES"<<endl;

#define cc ll test;cin>>test;while(test--)

#define all(V) (V).begin(),(V).end()

#define srt(V) sort(all(V))

#define srtGreat(V) sort(all(V),greater<ll>())

ll power(ll x,ll y)

{

ll res=1;

while(y>0)

{

if(y%2==1)res*=x;

y/=2; x*=x;

}

return res;

}

ll multiply(ll x,ll res[],ll res_size)

{

ll carry=0;

loop(i,0,res_size)

{

ll prod=res[i]*x+carry;

res[i]=prod%10;

carry=prod/10;

}

while(carry)

{

res[res_size]=carry%10;

carry=carry/10;

res_size++;

}

return res_size;

}

ll factorial(ll n)

{

ll res[500];

res[0]=1;

ll res_size=1;

loop(i,2,n+1)

{

res_size=multiply(i,res,res_size);

}

for(ll i=res_size-1;i>=0;i--)

cout<<res[i];

return 0;

}

int main()

{

//freopen("input.txt"a, "r", stdin);

pan;

ll n;

cin>>n;

cout<<"factorial of given number is : ";

factorial(n);

line;

}