//IN THE NAME OF GOD

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int del=10739,primes[11]={2,3,5,7,11,13,17,19,23,29,31};
ll ans;
void find_minimom_number(ll cur,ll prime,ll last,ll divisers){
    if(prime==12){
        if(divisers>=2011)
            ans=cur;
        return ;
    }
    long long int power=1;
    for(int i=0;i<=last;i++){
        if(cur*power>=ans)
            break;
        find_minimom_number(cur*power,prime+1,(long long)i,divisers*(i+1));
        power*=primes[prime];
    }
}
int main(){
    ans=1;
    for(int i=0;i<10;i++)
        ans*=2;
    for(int i=0;i<7;i++)
        ans*=3;
    for(int i=0;i<2;i++)
        ans*=5;
    ans*=7;
    ans*=11;
    ans*=13;
    find_minimom_number(1,0,22,1);
    cout<<ans%del<<endl;
    return 0;
}