#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define rep(i,a) for(int i=(int)0;i<(int)a;++i) #define pb push_back #define eb emplace_back using ll=long long; constexpr ll mod = 1e9 + 7; constexpr ll INF = 1LL << 50; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } using namespace std; ll gcd(ll n, ll m) { ll tmp; while (m!=0) { tmp = n % m; n = m; m = tmp; } return n; } ll lcm(ll n, ll m) { return abs(n * m) / gcd(n, m);//gl=xy } void solve(){ int n; cin>>n; vectora(n); rep(i,n)cin>>a[i]; ll mul=0; rep(i,n){ mul=gcd(mul,a[i]); } ll ans=0; rep(i,n){ a[i]/=mul; ans+=a[i]; } cout<