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
# vim: set fileencoding=utf-8 :

def main():
    n = int(raw_input())

    if n <= 8:
        print(0)
        exit()

    ans = 0
    for i in range(1, n + 1)[::2]:
        a = cal_yakusuu(i)
        if a:
            ans += 1

        i += 1

    print(ans)


def cal_yakusuu(odd):
    ret = False
    ct = 0
    for i in range(1, odd + 1):
        if odd % i == 0:
            ct += 1
            if ct > 8:
                ret = False

    if ct == 8:
        ret = True

    return ret


if __name__ == "__main__":
    main()
