#include <iostream>
using namespace std;

int gcd( int m, int n );

int main(int argc, const char * argv[]) {
    
    int L;
    cin >> L;
    
    int m = 2, n = 1;

    long long count = 0;
    while (true) {
        if(m <= n){
            m++;
            n = 1;
            continue;
        }
        else if((m-n) % 2 != 1){
            n++;
            continue;
        }
        else if(gcd(m,n) != 1){
            n++;
            continue;
        }
        
        int a = m*m - n*n;
        int b = 2 * m * n;
        int c = m*m + n*n;
        
        if((a+b+c)*4 <= L){
            count++;
        }
        
        
        if((m*m + 1) * 4 > L){
            break;
        }
        
        //cout << m << " " << n << " " << a + b + c << endl;
    
        n++;
    }
    
    cout << count % 1000003 << endl;
    
    return 0;
}

int gcd( int m, int n )
{
    // 引数に０がある場合は０を返す
    if ( ( 0 == m ) || ( 0 == n ) )
        return 0;
    
    // ユークリッドの方法
    while( m != n )
    {
        if ( m > n ) m = m - n;
        else         n = n - m;
    }
    return m;
}