#include <bits/stdc++.h>

using namespace std;

typedef long long int64;
typedef long double db;

const int N=200000;
const db eps=1e-12L;
const int64 INF=(1LL<<62)-1;

// struct bigint{

// };

int n;
int64 a[N+9],dp[N+9];

void DivideDP(int l,int r){
  if (l==r) return;
  int mid=(l+r)>>1;
  DivideDP(l,mid);
  std::vector<int> cv;
  auto check=[&](int x,int y,int z){
    // return (dp[z]-dp[y])*(1.0L/a[y]-1.0L/a[x])+eps>=(dp[y]-dp[x])*(1.0L/a[z]-1.0L/a[y]);
    return (__int128)a[2]*(a[0]-a[1])*(dp[2]-dp[1])>=(__int128)a[0]*(a[1]-a[2])*(dp[1]-dp[0]);
  };
  for (int i=l;i<=mid;++i){
    for (;!cv.empty()&&a[cv.back()]==a[i]&&dp[cv.back()]>=dp[i];cv.pop_back());
    for (;cv.size()>=2&&check(cv.end()[-2],cv.back(),i);cv.pop_back());
    cv.push_back(i);
  }
  for (int i=mid+1,j=0;i<=r;++i){
    auto val=[&](int x){
      return a[i]/a[x]+dp[x];
    };
    for (;j+1<(int)cv.size()&&val(cv[j+1])<=val(cv[j]);++j);
    dp[i]=std::min(dp[i],val(cv[j]));
  }
  DivideDP(mid+1,r);
}

void solve() {
  std::cin>>n;
  for (int i=1;i<=n;++i)
    std::cin>>a[i];
  std::sort(a+1,a+n+1);
  for (int i=1;i<=n;++i) dp[i]=INF;
  dp[1]=0;
  DivideDP(1,n);
  std::cout<<dp[n]<<'\n';
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int t=1;
  // cin >> t;
  while (t--) {
    solve();
  }
}