import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;
import std.numeric;

auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);}

const mod = 1000003;

void main()
{
  int l; readV(l);

  auto l4 = l/4, r = 0;
  foreach (m; 2..l4.nsqrt)
    for (auto n = m%2+1; n < m; n += 2) {
      if (gcd(m, n) != 1) continue;
      if (m*(m+n)*2 > l/4) break;
      ++r;
    }

  writeln(r%mod);
}

pure T nsqrt(T)(T n)
{
  import std.algorithm, std.conv, std.range, core.bitop;
  if (n <= 1) return n;
  T m = T(1) << (n.bsr/2+1);
  return iota(1, m).map!"a * a".assumeSorted!"a <= b".lowerBound(n).length.to!T;
}