using System; using System.IO; using System.Linq; using System.Text; using System.Diagnostics; using System.Collections.Generic; using System.Text.RegularExpressions; using Enu = System.Linq.Enumerable; class Program { static readonly int Mod = 1000003; void Solve() { int L = reader.Int() / 4; long ans = 0; for (long m = 1; m * m < L; m++) { for (long n = 1; n < m && n * n + m * m < L; n++) { if (m % 2 == n % 2) continue; if (GCD(m, n) > 1) continue; long a = m * m - n * n; long b = 2 * m * n; long c = m * m + n * n; if (a + b + c > L) continue; //long count = L / (a + b + c); //Console.WriteLine(a + "," + b + "," + c + " - " + count); ans += 1; ans %= Mod; } } Console.WriteLine(ans); } static long GCD(long a, long b) { while (b != 0) { long r = a % b; a = b; b = r; } return a; } Reader reader = new Reader(Console.In); static void Main() { new Program().Solve(); } } class Reader { private readonly TextReader reader; private readonly char[] separator = { ' ' }; private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries; private string[] A = new string[0]; private int i; public Reader(TextReader r) { reader = r; } public bool HasNext() { return Enqueue(); } public string String() { return Dequeue(); } public int Int() { return int.Parse(Dequeue()); } public long Long() { return long.Parse(Dequeue()); } public double Double() { return double.Parse(Dequeue()); } public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); } public int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public int[][] IntGrid(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); } public string Line() { return reader.ReadLine().Trim(); } private string[] Split(string s) { return s.Split(separator, removeOp); } private bool Enqueue() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return Enqueue(); A = Split(line); i = 0; return true; } private string Dequeue() { Enqueue(); return A[i++]; } }