import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.TreeSet;
public class Main {
	public static boolean result[];
	public static int dp[][];
	public static void main(String[] args) throws NumberFormatException, IOException{
		ContestScanner in = new ContestScanner();
		long n = in.nextLong()/4;
		long count = 0;
		long mod = 1000003;
		TreeSet<Integer> set = new TreeSet<Integer>();
		for(int i=1; i<=n; i++){
			for(int j=i+1; j<=n; j++){
				if((j-i)%2 == 0) continue;
				if(gcd(i,j) != 1) continue;
				int a = i*i+j*j;
				int b = 2*i*j;
				int c = j*j-i*i;
				long p = gcd(gcd(a,b), c);
				a/=p;
				b/=p;
				c/=p;
				if(a+b+c <= n){
					if(!set.contains(a+b+c)){
						set.add(a+b+c);
//						System.err.println(a+" "+b+" "+c);
					count++;
					if(count >= mod) count%=mod;
					}
				}
			}
		}
		System.out.println(count);
	}
	
	static int gcd(int a, int b){
		return b == 0 ? a : gcd(b, a % b);
	}
}

class MyComp implements Comparator<int[]>{
	public int compare(int[] a, int[] b) {
		return a[0] - b[0];
	}
}

class Reverse implements Comparator<Integer>{
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}

class Node{
	int id;
	List<Node> edge = new ArrayList<Node>();
	public Node(int id){
		this.id = id;
	}
	public void createEdge(Node node){
		edge.add(node);
	}
}

class ContestScanner{
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner() throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));
	}
	
	public String nextToken() throws IOException{
		if(line == null || line.length <= idx){
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	public long nextLong() throws IOException, NumberFormatException{
		return Long.parseLong(nextToken());
	}
	public int nextInt() throws NumberFormatException, IOException{
		return (int)nextLong();
	}
	public double nextDouble() throws NumberFormatException, IOException{
		return Double.parseDouble(nextToken());
	}
}