// 想定解: ピタゴラス数の列挙
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void rc(int v,int mn,int mx){if(v<mn||mx<v){cerr<<"error"<<endl;exit(1);}}
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
const int MAXN = 100000000;
const int MOD = 1000003;

ll gcd(ll n, ll m){return m?gcd(m,n%m):n;}

int main(){
    int L;
    cin >> L; rc(L, 1, MAXN);
    L /= 4;
    int maxm = int(sqrt(L+.0))+2;

    int cnt = 0;
    for(int m = 1; m <= maxm; m++){
        for(int n = m-1; n >= 1; n -= 2){
            if(gcd(m,n) != 1) continue;
            if((ll)2*m*(m+n) <= L) cnt++;
        }
    }
    cout << cnt % MOD << endl;
}