#include <bits/stdc++.h>
using namespace std;
int mod = 1000003;

int gcd(int a, int b) {
    while (b) {
        int c = b;
        b = a % b;
        a = c;
    }
    return a;
}

int main() {
    int L;
    cin >> L;
    L /= 4;

    set<pair<int, int>> S;
    int ans = 0;
    for (int i = 1; i * i < L; i++) {
        for (int j = i + 1; j * j < L; j++) {
            int x = j * j - i * i;
            int y = j * j + i * i;
            int z = 2 * i * j;
            if (x + y + z > L)
                continue;
            if (gcd(x, y) != 1)
                continue;
            if (S.count({x, y}))
                continue;
            S.insert({x, y});
            ans++;
        }
    }

    ans %= mod;
    cout << ans << endl;
}