#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

const ll N = 4444;
const ll N4 = N*N*N*N;

int cnt[N+1][333];
ll pw3[N+1];
ll pw4[N+1];

void init(){
    pw4[0] = 1;
    for(ll x = 1; x <= N; x++){
        pw4[x] = x*x*x*x;
        pw3[x] = x*x*x;
    }
    for(ll x = 1; x <= N; x++){
        for(int a = 0; a < 333; a++){
            cnt[x][a] = cnt[x-1][a];
        }
        cnt[x][(x*x*x)%333]++;
    }
}

ll solve(int a){
    ll ans = 0;
    for(ll x = 1; x <= N; x++){
        ll x4 = pw4[x];
        ll z = N;
        for(ll y = 1; x4+pw4[y] <= N4; y++){
            ll y4 = pw4[y];
            while(x4+y4+pw4[z] > N4) z--;
            ll rem = (666+a-(pw3[x]+pw3[y])%333)%333;
            ans += cnt[z][rem];
        }
    }
    return ans;
}

ll ans[] = {353412483,499853409,198066141,65944976,0,0,83359314,197704749,499956396,461596998,499924557,250031589,66025737,0,0,65922195,197880351,395804754,461671050,395752629,197825844,65951319,0,0,65936360,197777304,499639056,583029498,395715012,249552855,66073349,0,0,66026043,197876565,395514645,582863367,303214194,249900573,66080034,0,0,65941840,249952551,395548158,583092006,395796816,250096923,83408904,0,0,83352606,197785611,395734917,461688090,395834907,197910177,65958885,0,0,83129445,197879421,395601315,583179990,499975596,197894460,83217288,0,0,65851552,197977152,395723337,461598072,499492386,151682058,83391159,0,0,65982393,197810568,499698792,461615477,499465320,197929308,83479962,0,0,66034772,249868407,395609340,461586120,395850384,197943681,65989561,0,0,66018201,249605913,395763186,461545017,500244135,250121904,65992770,0,0,83439696,197582427,395906010,461534357,395972283,249747105,50667829,0,0,65970890,197840178,395783145,582714366,395839320,249607272,66034569,0,0,65970813,197862537,499837770,461586033,395704725,197937468,66025153,0,0,65971953,197855130,499324197,461779937,395694588,250272546,83394459,0,0,65931391,250137234,395347209,461799958,395664129,198104688,83187177,0,0,65844093,197915487,395640954,461877100,499267476,197996145,83116794,0,0,83077128,197816517,395716419,583089981,395680647,197847309,66034770,0,0,65927544,197856531,395729877,582755274,395784210,197870754,83518725,0,0,83482623,197741811,500063223,461407793,395845749,197818044,66124482,0,0,83419152,197585898,395806743,461487779,396117981,249519294,66035306,0,0,83193621,249380424,395683833,461503212,500027589,197855943,65988450,0,0,65930507,197764092,395690775,461566449,499518105,197901777,65986020,0,0,65933772,250096410,395624835,583102701,395703927,197915679,65987298,0,0,50523021,249970845,395405595,461756184,395565168,198146163,83144547,0,0,65983467,249543381,499087524,461617473,395695518,250057275,65957211,0,0,65974043,197782437,395546595,461593956,395765376,249800436,65946828,0,0,83100603,197759865,499933236,461658190,499637970,197937693,65994989,0,0,83165199,151389405,499921449,461545845,395752965,197762508,66111248,0,0,83355123,197818980,499370913,582628467,395794911,197844207,83457036,0,0,66017907,197835168,395622237,461486226,395661093,197892921,83237010,0,0,83211351,249550986,395580453,582788094,395923029,249712644,66025575,0,0,65897514,249726033,302922846,583014219,395884293,197863206,65933645,0,0,65893369,250099782,395686374,582793884,499733808,197928006,66021523,0,0,66010887,197890128,395726169,461611814,395609376,197826183,66037128,0,0,65941779,249662991,499401411,461547663,499391031,198039087,83234613,0,0,66018343,197644773,499469412};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    // init();
    // for(int a = 0; a < 333; a++){
    //     cout << solve(a) << ',';
    // }
    // cout << endl;
    int a; cin >> a;
    a %= 333;
    cout << ans[a] << endl;
}