import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = (1 << 63)-1
inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

class Sieve:
    def __init__(self, n):
        self.plist = [2]  # n以下の素数のリスト
        min_prime_factor = [2, 0]*(n//2+1)
        for x in range(3, n+1, 2):
            if min_prime_factor[x] == 0:
                min_prime_factor[x] = x
                self.plist.append(x)
                if x**2 > n: continue
                for y in range(x**2, n+1, 2*x):
                    if min_prime_factor[y] == 0:
                        min_prime_factor[y] = x
        self.min_prime_factor = min_prime_factor

    def isprime(self, x):
        return self.min_prime_factor[x] == x

    # これが素因数分解(prime factorization)
    def pfct(self, x):
        pp, ee = [], []
        while x > 1:
            mpf = self.min_prime_factor[x]
            if pp and mpf == pp[-1]:
                ee[-1] += 1
            else:
                pp.append(mpf)
                ee.append(1)
            x //= mpf
        return pp

from collections import defaultdict

n = II()
sv = Sieve(n)

ptoi = {p: i for i, p in enumerate(sv.plist)}

ptoa = defaultdict(list)
aa = [1]*(n+1)
for p in sv.plist[::-1]:
    for i in range(p, n+1, p):
        if aa[i]:
            ptoa[p].append(i)
            aa[i] = 0
# pDB(ptoa)

dp = defaultdict(int)
dp[0] = 0
for p in sv.plist:
    up = []
    for a in ptoa[p]:
        s = 0
        for pf in sv.pfct(a):
            if pf**2 < n:
                i = ptoi[pf]
                s |= 1 << i
        for ps, pv in dp.items():
            if s & ps: continue
            ns = ps | s
            nv = pv+a
            up.append((ns, nv))
    for s, v in up:
        dp[s] = max(dp[s], v)
    # pDB(dp)

ans = max(dp.values())
print(ans)