HDU2197 本原串

#include"bits/stdc++.h"
using namespace std;
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define repp(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define see(x) (cerr<<(#x)<<‘=‘<<(x)<<endl)
#define inf 0x3f3f3f3f
#define CLR(A,v)  memset(A,v,sizeof A)
//////////////////////////////////
const int N=100000000+10 ;
const int mod=2008;

ll fast(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1)ans=ans*x%mod;
        x=x*x%mod;
        n>>=1;
    }
    return ans;
}
ll mp[N],n;

ll cal(ll n)
{
    if(mp[n])return mp[n];
    mp[n]=fast(2,n)-2;
    for(ll i=2;i*i<=n;i++)
    {
        if(n%i==0)
        {
            mp[n]=(mp[n]-cal(i)+mod)%mod;
            if(i*i!=n)mp[n]=(mp[n]-cal(n/i)+mod)%mod;
        }
    }
    return mp[n];
}

int main()
{
    mp[0]=0;
    mp[1]=2;
    mp[2]=2;
    while(cin>>n)
    {
        cout<<cal(n)<<endl;
    }
}