#include using namespace std; #define ll long long #define endl '\n' ll pow(ll x,ll y,ll m=1e9+7){ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;} void solve() { int n; cin>>n; vectorv(n); int l=1; for(int i=0; i>v[i]; l = lcm(l,v[i]); } int sum=0; for(auto x:v) sum += l/x; if(sum>=l) { cout<<-1<> TCS; for (int TC = 1; TC <= TCS; ++TC) { // cout<<"Case "<