import sys
sys.setrecursionlimit(200000)
from collections import defaultdict
from itertools import product
from copy import deepcopy, copy
n = int(input())
so = (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31)
sn = set(range(2, n + 1))
sc = set()
sm = defaultdict(set)
for i in range(2, n + 1):
    for a in (b for b in so if b <= i and b * 2 <= n):
        if i % a == 0:
            sm[a].add(i)
            sc.add(i)
for v in list(sm.values()):
    v = list(v)
    for b, c in product(list(v), repeat=2):
        sm[b].add(c)
    if len(sm[v[0]]) == 1:
        sc.add(v[0])
        sn.remove(v[0])
        continue
ans = 0
def f(a, n, st, cnt):
    if len(st) == 0 or a > n:
        global ans
        ans = max(ans, cnt)
        return
    if sm[so[a]] & st:
        for b in sm[so[a]] & st:
            f(a + 1, n, st - sm[b], cnt + b)
    else:
        f(a + 1, n, st, cnt)
f(0, sum(1 for b in so if b <= n), sc, 0)
print(ans + sum(sn - sc))