#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int fx[] = {+1, -1, +0, +0, +1, +1, -1, -1, +0};
int fy[] = {+0, +0, +1, -1, +1, -1, +1, -1, +0};
template <typename T>
inline T GCD(T a, T b) {
  a = abs(a);
  b = abs(b);
  if (a < b) swap(a, b);
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
template <typename T>
inline T LCM(T x, T y) {
  T tp = GCD(x, y);
  if ((x / tp) * 1. * y > 9e18) return 9e18;
  return (x / tp) * y;
}
template <typename T>
inline T BigMod(T A, T B, T M = MOD) {
  T ret = 1;
  while (B) {
    if (B & 1) ret = (ret * A) % M;
    A = (A * A) % M;
    B = B >> 1;
  }
  return ret;
}
template <typename T>
inline T InvMod(T A, T M = MOD) {
  return BigMod(A, M - 2, M);
}
template <typename T>
T scani(T &n) {
  n = 0;
  bool negative = false;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') negative = true;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    n = n * 10 + c - 48;
    c = getchar();
  }
  if (negative) n = ~(n - 1);
  return n;
}
template <typename T>
void write(T n, int type = true) {
  if (n < 0) {
    putchar('-');
    n = -n;
  }
  if (!n) {
    putchar('0');
    if (type == 32)
      putchar(' ');
    else if (type)
      putchar('\n');
    return;
  }
  char buff[22];
  int len = 0;
  while (n) buff[len++] = n % 10 + 48, n /= 10;
  for (int i = len - 1; i >= 0; i--) putchar(buff[i]);
  if (type == 32)
    putchar(' ');
  else if (type)
    putchar('\n');
}
int scans(char *a) {
  int i = 0;
  char c = 0;
  while (c < 33) c = getchar();
  while (c > 33) {
    a[i++] = c;
    c = getchar();
  }
  a[i] = 0;
  return i;
}
const int N = 200000 + 200;
long long in[N];
long long Bit[N];
int n;
void update(long long x, int val) {
  while (x < N) {
    Bit[x] += val;
    x += x & -x;
  }
}
long long query(int x) {
  long long ret = 0;
  while (x) {
    ret += Bit[x];
    x -= x & -x;
  }
  return ret;
}
int main() {
  scani(n);
  for (int i = 1; i <= n; i++) scani(in[i]);
  set<int> st;
  sort(in, in + n);
  for (int i = 1; i <= n; i++) {
    long long x = in[i];
    st.insert(x);
    update(1, 1);
    update(x + 1, -1);
  }
  long long ans, mx;
  ans = 0;
  for (long long i = 1; i < N; i++) {
    mx = 0;
    if (st.find(i) == st.end()) continue;
    for (long long j = i; j < N; j += i) {
      mx += i * query(j);
    }
    ans = max(ans, mx);
  }
  write(ans);
  return 0;
}
