// Project Euler problem 73
from fractions import gcd

candidates = [(n,d) for n in xrange(1, limit + 1) for d in xrange(1, limit + 1)]
filtered = filter(lambda (n,d): 1.0 / 2 > 1.0 * n / d > 1.0 / 3 and gcd(n,d) == 1,
                  candidates)
print len(filtered)