#include using namespace std; #define ll long long #define all(x) x.begin(),x.end() #define rep(i,a,b) for(int i=a;i<=b;i++) #define rep_r(i,a,b) for(int i=a;i>=b;i--) #define each(a,x) for (auto& x : a) using pi = pair; using pl = pair; using vi = vector; using vl = vector; #define sz(x) int(x.size()) #define so(x) sort(all(x)) #define so_r(x) sort(all(x),greater()) #define lb lower_bound #define ub upper_bound const char nl = '\n'; int dx[4] = {1,-1,0,0}; int dy[4] = {0,0,1,-1}; int bit_cnt(int x){ return __builtin_popcount(x); } ll bex(ll a, ll b, ll mod = 1e9 + 7){ll res = 1LL; while(b){ if (b&1) res = res * a % mod; a = a * a % mod; b >>= 1;} return res;} template bool chmax(t&a,u b){if(a bool chmin(t&a,u b){if(b> n; cin >> K; rep(i,0,n-1) cin >> a[i]; // https://yukicoder.me/problems/no/1083 // Brief: cho day A gom N so nguyen va K // Tuy y sap xep thu tu trong A // X = K % A[1] % A[2] .... % A[N] // Tim Max X // constraint: N <= 20, K <= 1e9, A <= 1e9 // K % A[i] % A[j] = K % A[i] (if A[i] < A[j]) sort(a,a+n, greater<>()); ll ans = 0; rep(msk,0,(1<<(n-1))-1){ ll cur = K; rep(i,0,n-2) if (msk>>i&1) cur %= a[i]; chmax(ans,cur%a[n-1]); } cout << ans << nl; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; // cin >> t; while (t--){ solve(); } }