import sys
import math
import bisect
from heapq import heapify, heappop, heappush
from collections import deque, defaultdict, Counter
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product

sys.set_int_max_str_digits(10 ** 6)
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD99 = 998244353

input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
SMI = lambda: input().split()
SLI = lambda: list(SMI())
EI = lambda m: [NLI() for _ in range(m)]


def main():
    N = NI()
    F = [1, 3, 5, 17, 257, 65537]
    S = set()
    for k in range(1, len(F)+1):
        for C in combinations(F, k):
            n = 1
            for x in C:
                n *= x
            while n <= N:
                if n >= 3:
                    S.add(n)
                n *= 2
    # print(S)
    print(len(S))
    
    
if __name__ == "__main__":
    main()