#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef pair<int,int> P;
typedef long double ld;

int main(){
	int n;
	cin >> n;
	vl a(n);
	rep(i, n) cin >> a[i];
	if(n <= 5){
		
		ll ans = 0;
		vi perm(n);
		rep(i, n) perm[i] = i;
		vi q(n);
		rep(i, n) q[i] = i;
		do{
		ll tmp = 0;
			rep(i, n) tmp += a[perm[i]] % a[perm[(i + 1) % n]];
			if(tmp > ans){
				ans = tmp;
				q = perm;
			}
		}while(next_permutation(perm.begin(), perm.end()));
		cout << ans << "\n";
		return 0;
	}
	
	ll base = 0;
	rep(i, n) base += a[i] % a[(i + 1) % n];
	ll ans = base;
	vl b(n);
	rep(i, n) b[i] = a[n - 1] % a[i];
	vi left(n);
	rep(i, n){
		if(i == 0) continue;
		if(b[left[i - 1]] < b[i]) left[i] = i;
		else left[i] = left[i - 1];
	}
	for(int j = 0; j < n - 1; j++){
		ll tmp = base;
		tmp -= a[n - 1] % a[0];
		tmp -= a[j] % a[(j + 1) % n];
		tmp += a[n - 1] % a[left[j]];
		tmp += a[j] % a[0];
		ans = max(tmp, ans);
//		cout << tmp << "\n";
	}
	cout << ans;
	return 0;
}