#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

#define FORR(i,b,e) for(int i=(b);i<(int)(e);++i)
#define FOR(i,e) FORR(i,0,e)
#define sortuniq(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(),v.end()),v.end())
#define dump(var) cerr << #var ": " << var << "\n"
#define dumpc(con) for(auto& e: con) cerr << e << " "; cerr<<"\n"

typedef long long ll;
typedef unsigned long long ull;

const double EPS = 1e-6;
const int d4[] = {0, -1, 0, 1, 0};

using namespace std;


int gcd(int m, int n) {
    int t;
    while (m != 0) {
        t = m;
        m = n % m;
        n = t;
    }
    return n;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int L;
    cin >> L;

    L /= 4;
    int l = (int)sqrt(L) + 1;
    int p = 0;
    for (int m = 1; m < l; ++m) {
        for (int n = 1 + (m&1); n < m; n += 2) {
            if (gcd(m, n) == 1) {
                int a = 2*m*n, b = m*m-n*n, c = m*m+n*n;
                if (a + b + c > L) goto OUTERLOOP;
                // cout << '(' << a << ',' << b << ',' << c << ')';
                p++;
            }
        }
        OUTERLOOP:;
    }
    cout << p % 1000003 << endl;
    
    return 0;
}