#include<bits/stdc++.h>
#define mod 666013
#define N 5010
using namespace std;

ifstream f("100m.in");
ofstream g("100m.out");

long long a[N],b[N],n,ans;

int main()
{
    f>>n;
    a[0]=b[0]=1;

    //Stirling de tipul 2

    for(int i=1;i<n;++i)
    {
        for(int j=1;j<=i;++j)
            b[j]=((j+1)*a[j]+a[j-1])%mod;
        for(int j=0;j<=i;++j)
            a[j]=b[j];
    }
    long long f=1;
    for(int i=1;i<=n;++i)
    {
        ans=(ans+b[i-1]*f)%mod;
        f=f*(i+1)%mod;
    }
    g<<ans<<"\n";
    return 0;
}