def solve(A):
    F = [3, 5, 17, 257, 65537]

    n = 0
    for i in range(1 << len(F)):
        ff = 1
        for j in range(len(F)):
            if i & (1 << j):
                ff *= F[j]
        while ff <= A:
            if ff >= 3:
                n += 1
            ff *= 2
    print(n)


def main():
    A = int(input())
    solve(A)


if __name__ == '__main__':
    main()