#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
vector<ll> primes;
vector<ll> is_prime(1000001);
ll N=0;
ll ans2;
ll x;
void solve()
{
    ll k;
    x = 0;
    k = 999983;
    ll ans=0, mn=1e9;
    for (int i=0;i<N;i++)
    {
        ans+=k*primes[i];
        if (k%primes[i]==0)
            x=i;
        if (primes[i]==is_prime[k])
            break;
    }
    // for (int i=0;i<N;i++)
    // {
    //     ans+=k*primes[i];
    //     if (!(k%primes[i]))
    //         break;
    // }
    x+=ans;
    ans2 += ans % 10000;
}
int main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    ll t;
    int n=1e6;
    for (int i=0;i<n;i++)
        is_prime[i]=i;
    is_prime[0] = is_prime[1] = -1;
    for (ll i = 2; i * i <= n; i++) {
        if (is_prime[i]) {
            for (ll j = i * i; j <= n; j += i)
                is_prime[j] = min(i, is_prime[j]);
        }
    }
    for (int i=2;i<=n;i++)
        if (is_prime[i]==i)
            primes.push_back(i),N++;
    t = 10000;
    while(t--)
    {
        solve();
    }
    cout << ans2 << '\n';
    return 0;
}