#2259

#include <iostream>
#define mod 30103
using namespace std;
int n,par[100001],imp[100001];
int main()
{
    cin>>n;
    par[1]=4;
    imp[1]=5;
    for(int i=2;i<=n;++i)
    {
        par[i]=(imp[i-1]*4)%mod;
        imp[i]=(par[i-1]*5)%mod;
    }
    cout<<(par[n]+imp[n])%mod;
    return 0;
}

#1991

#include <iostream>
#define mod 9001
using namespace std;
int n,k,v[100001];
int main()
{
    cin>>n>>k;
    v[1]=1;
    for(int i=2;i<=n;++i)
        for(int j=1;j<=k && j<i;++j)
           v[i]+=v[i-j],v[i]=v[i]%mod;
    cout<<v[n];
    return 0;
}

#2882

#include <fstream>
#define mod 666013
using namespace std;
ifstream cin("no_pals.in");
ofstream cout("no_pals.out");
int n,nr,nrp;
int main()
{
    cin>>n;
    nr=9,nrp=9;
    cout<<nr-nrp<<'\n';
    for(int i=2;i<=n;++i)
    {
        nr=(10*nr)%mod;
        if(i%2==1)
            nrp=(nrp*10)%mod;
        else
            nrp=nrp%mod;
    cout<<(nr-nrp+mod)%mod<<'\n';
    }
    return 0;
}