#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
#include <stack>

using namespace std;

long gcd(long x,long y)
{
	return y==0 ? x : gcd(y,x%y);
}

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

	long long res=0;
	for(long m=1;m*m<=L;m++){
		for(long n=1;n<m;n++){
			if((m-n)%2==0 || gcd(m,n)!=1) continue;
			//cout<<m*m-n*n<<" "<<2*m*n<<" "<<m*m+n*n<<endl;
			if(2*m*m+2*m*n<=L){ res++; res%=1000003;}
			else break;
		}
	}
	cout<<res<<endl;

	return 0;
}