#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int gcd(int a, int b) {
	if (b == 0) return a;
	return gcd(b, a % b);
}

int l;
int mod = 1000003;

int main() {
	cin >> l;
	l /= 4;
	
	set<set<int> > ans;
	
	FOR(i, 1, 4000) FOR(j, i + 1, 4000) {
		int a = j * j - i * i;
		int b = 2 * i * j;
		int c = j * j + i * i;
		
		if (a + b + c > l) break;
		
		int g = gcd(a, gcd(b, c));
		
		set<int> now;
		now.insert(a / g); now.insert(b / g); now.insert(c / g);
		
		ans.insert(now);
	}
	
	cout << ans.size() % mod << endl; 
	
	return 0;
}