#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

#define MOD (1000003)

int gcd(int a, int b) {
	if (a < b) return gcd(b, a);
	if (a % b == 0) return b;
	return gcd(b, a % b);
}

int main(int argc, char **argv) {
	int L;
	cin >> L;
	int res = 0;
	FOR(m, 2, 5000) for (int n = 1 + m % 2; n < m; n += 2) {
		if (gcd(m, n) != 1) continue;
		int l = 2 * m * (m + n);
		if (l * 4 > L) break;
		++res;
	}
	cout << res << endl;
	return 0;
}