#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

int gcd(int a, int b) {
	while (b != 0) {
		a = a % b;
		swap(a, b);
	}
	return a;
}

int main()
{
	ll L; cin >> L;
	int mod = 1000003;

	ll ans = 0;
	for (ll i = 1; i <= L; i++) {
		for (ll j = i + 1; ; j++) {
			ll sum = i*i + j*j + 2 * i*j + j*j - i*i;
			if ((L - sum * 4) >= 0) {
				if ((j - i) % 2 != 0) {
					ll m[3];
					m[0] = i*i + j*j;
					m[1] = i*j * 2;
					m[2] = j*j - i*i;
					if (gcd(m[0], gcd(m[1], m[2])) == 1) {
						ans++;
						ans %= mod;
					}
				}
			}
			else
				break;
		}
	}
	cout << ans << endl;
	return 0;
}