#include using namespace std; int gcd(int y,int z){ while(y != z){ if(y > z) y -= z; else z -= y; } return y; } int main(){ long long n; cin >> n; vector a(n); for(auto &x:a) cin >> x; bool flag = true; for(int i = 0; i < n; i++){ if(100 / n != a[i]){ flag = false; break; } } sort(a.begin(),a.end()); if(flag) cout << n << endl; else{ int ans = 0, g = 100; for(int i = 1; i < n; i++){ g = min(g,gcd(a[0],a[i])); } for(int i = 0; i < n; i++){ ans += a[i] / g; } cout << ans << endl; } return 0; }