#include using namespace std; typedef long long ll; unordered_map sd; inline bool isPrime(ll x) { if(x<2 || (x%2==0 && x!=2)) return false; if(sd[x]!=0) return false; for(ll i=3;i*i<=x;i+=2) if(x%i==0) {sd[x]=i;return false;} return true; } int main() { //ll n;cin>>n; //cout<> n; ll s=0; vector a(n); // ll s=0; for (ll i = 0; i < n; i++) { cin >> a[i]; ll tr=1; while(a[i]!=1) { //cout<