#define _USE_MATH_DEFINES #include using namespace std; //template #define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define ALL(v) (v).begin(),(v).end() typedef long long int ll; const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12; templateinline bool chmax(T& a,T b){if(ainline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;} //end templatestruct fp { unsigned v; static unsigned get_mod(){return mod;} unsigned inv() const{ int tmp,a=v,b=mod,x=1,y=0; while(b)tmp=a/b,a-=tmp*b,swap(a,b),x-=tmp*y,swap(x,y); if(x<0){x+=mod;} return x; } fp():v(0){} fp(ll x):v(x>=0?x%mod:mod+(x%mod)){} fp operator-()const{return fp(-v);} fp pow(ll t){fp res=1,b=*this; while(t){if(t&1)res*=b;b*=b;t>>=1;} return res;} fp& operator+=(const fp& x){if((v+=x.v)>=mod)v-=mod; return *this;} fp& operator-=(const fp& x){if((v+=mod-x.v)>=mod)v-=mod; return *this;} fp& operator*=(const fp& x){v=ll(v)*x.v%mod; return *this;} fp& operator/=(const fp& x){v=ll(v)*x.inv()%mod; return *this;} fp operator+(const fp& x)const{return fp(*this)+=x;} fp operator-(const fp& x)const{return fp(*this)-=x;} fp operator*(const fp& x)const{return fp(*this)*=x;} fp operator/(const fp& x)const{return fp(*this)/=x;} bool operator==(const fp& x)const{return v==x.v;} bool operator!=(const fp& x)const{return v!=x.v;} }; using Fp=fp<>; Fp calc(ll n){ //sum_{x*x+y*y<=n} abs(x)+abs(y) Fp res; for(ll x=1;x*x<=n;x++){ Fp y=(ll)sqrt(n-x*x)*2+1; res+=y*x; } return res*4; } int main(){ ll n; cin>>n; const int m=1010101; vector mu(m,1); bitset isp; rep(i,2,m)isp[i]=1; for(ll i=2;i