#include #include using namespace std; typedef long long ll; typedef pair P; typedef pair T; long long int INF = 1e17; const ll fact_table = 800008; double Pi = 3.1415926535897932384626; priority_queue pql; priority_queue

pqp; //big priority queue priority_queue ,greater > pqls; // priority_queue ,greater

> pqps; //small priority queue //top pop ll dx[8]={1,0,-1,0,1,1,-1,-1}; ll dy[8]={0,1,0,-1,1,-1,-1,1}; char dir[] = "DRUL"; //↓,→,↑,← #define p(x) cout< number2){ swap(number1,number2); } if(number1 == 0 || number1 == number2){ return number2; }else{ return gcd(number2 % number1,number1); } } void YES(bool condition){ if(condition){ p("YES"); }else{ p("NO"); } return; } void Yes(bool condition){ if(condition){ p("Yes"); }else{ p("No"); } return; } /* ll fact[fact_table + 5],rfact[fact_table + 5]; void c3_init(){ fact[0] = rfact[0] = 1; for(ll i=1; i<=fact_table; i++){ fact[i] = (fact[i-1]*i) % mod; } rfact[fact_table] = rui(fact[fact_table],mod - 2); for(ll i=fact_table; i>=1; i--){ rfact[i-1] = rfact[i] * i; rfact[i-1] %= mod; } return;} ll c3(ll n,ll r){ return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;} */ ll n,m,num,sum,ans,a,b,c,d,e,h,r,l,q; ll k; ll x[300005], y[100005]; vector G[500005]; ll dp[500005]; int main(){ cin >> n; for(ll i=0;i> x[i]; } dp[x[0]] = 1; for(ll i=1;i v; for(ll j=1;j*j<=num;j++){ if(num % j == 0){ v.pb(j);v.pb(num / j); } } for(ll j=0;j