The number 105 is quite special - it is odd but still it has eight divisors. Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?

Constraints

* N is an integer between 1 and 200 (inclusive).

Input

Input is given from Standard Input in the following format:


N


Output

Print the count.

Examples

Input

105


Output

1


Input

7


Output

0
def divisors_num(x):
    foo = 0
    p = 1
    while p * p <= x:
        if x % p == 0:
            q = x / p
            if p != q:
                foo += 2
            else:
                foo += 1
        p += 1
    return foo

def main():
    n = int(raw_input().strip())
    foo = 0
    for k in xrange(1, n + 1, 2):
        if divisors_num(k) == 8:
            foo += 1
    print foo

if __name__ == '__main__':
    main()
