#include<stdio.h>
#include<math.h>

int gcd(int m,int n){
  int r=m%n;
  while(r>0){
    m=n;
    n=r;
    r=m%n;
  }
  return n;
}

int main(void){
  int L;
  scanf("%d",&L);

  L=L/4;
  int m,n;
  int count=0;
  for(m=2;m<=(-1.0+sqrt(1+2*L))/2;m++){
    for(n=1+(m&0x01);n<m && n<=L/(2*m)-m;n+=2){
      if(gcd(m,n)==1){
        count=(count+1)%1000003;
      }
    }
  }

  printf("%d\n",count);

  return 0;
}