import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.Queue; import java.util.StringTokenizer; public class Main { void solve() throws IOException { int l = ni(); l /= 4; int n = 1; while ((n + 1) * (n + 1) <= l) n++; int ans = 0; for (int i = 2; i <= n; i++) { for (int j = 1; j < i; j++) { if ((i + j) % 2 == 1 && gcd(i, j) == 1 && 2 * i * j + 2 * i * i <= l) { ans++; } } } out.println(ans); } int gcd(int a, int b) { return a == 0 ? b : gcd(b % a, a); } String ns() throws IOException { while (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine(), " "); } return tok.nextToken(); } int ni() throws IOException { return Integer.parseInt(ns()); } long nl() throws IOException { return Long.parseLong(ns()); } double nd() throws IOException { return Double.parseDouble(ns()); } String[] nsa(int n) throws IOException { String[] res = new String[n]; for (int i = 0; i < n; i++) { res[i] = ns(); } return res; } int[] nia(int n) throws IOException { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = ni(); } return res; } long[] nla(int n) throws IOException { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nl(); } return res; } static BufferedReader in; static PrintWriter out; static StringTokenizer tok; public static void main(String[] args) throws IOException { in = new BufferedReader(new InputStreamReader(System.in)); out = new PrintWriter(System.out); tok = new StringTokenizer(""); Main main = new Main(); main.solve(); out.close(); } }