import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum LIM = 1300;

// # of primes < 37
enum L = 11;

bool[] isnp;
int[] primes;

void prepare() {
  isnp = new bool[LIM];
  foreach (i; 2 .. LIM) {
    if (!isnp[i]) {
      primes ~= i;
      for (int j = 2 * i; j < LIM; j += i) {
        isnp[j] = 1;
      }
    }
  }
}

void main() {
  prepare();
  
  try {
    for (; ; ) {
      const N = readInt();
      auto ys = new int[N + 1];
      foreach (n; 0 .. N + 1) {
        foreach (l; 0 .. L) {
          if (n % primes[l] == 0) {
            ys[n] |= 1 << l;
          }
        }
      }
      auto dp = new int[][](primes.length + 1, 1 << L);
      foreach (i, p; primes) {
        foreach_reverse (x; 0 .. 1 << L) {
          chmax(dp[i + 1][x], dp[i][x]);
          for (int n = p; n <= N; n += p) {
            if (!(x & ys[n])) {
              chmax(dp[i + 1][x | ys[n]], dp[i][x] + n);
            }
          }
        }
      }
      const ans = dp[primes.length].maxElement;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}