#pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include // #include // #include // #include // using namespace __gnu_pbds; // #include // namespace multiprecisioninteger = boost::multiprecision; // using cint=multiprecisioninteger::cpp_int; using namespace std; using ll=long long; #define double long double using datas=pair; using ddatas=pair; using tdata=pair; using vec=vector; using mat=vector; using pvec=vector; using pmat=vector; // using llset=tree,rb_tree_tag,tree_order_statistics_node_update>; #define For(i,a,b) for(i=a;i<(ll)b;++i) #define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i) #define rep(i,N) For(i,0,N) #define rep1(i,N) For(i,1,N) #define brep(i,N) bFor(i,N,0) #define brep1(i,N) bFor(i,N,1) #define all(v) (v).begin(),(v).end() #define allr(v) (v).rbegin(),(v).rend() #define vsort(v) sort(all(v)) #define vrsort(v) sort(allr(v)) #define endl "\n" #define eb emplace_back #define print(x) cout< ostream& operator<<(ostream& os,pair& p){return os<<"{"< inline bool chmax(T& a,T b){bool x=a inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} int M,phi[1000001]; ll ans; vector divisor[1000001]; int main(){ int i,j; for(i=1;i<1000001;++i){ phi[i]=i-phi[i]; for(j=i;j<1000001;j+=i){ divisor[j].eb(i); if(j!=i)phi[j]+=phi[i]; } } scanf("%d",&M); scanf("%d",&M); // cin>>M>>M; while(M--){ scanf("%d",&i); // ans=0; for(auto d:divisor[i]){ ans+=(i-1)%d*phi[i/d]; } // print(ans); } printf("%d\n",ans); }