#include<bits/stdc++.h>

using namespace std;

const int maxn=;

int a[maxn];

int main()

{

    int K,N,i,cnt=,pos;

    scanf("%d%d",&K,&N);

    for(i=;i<=N;i++) scanf("%d",&a[i]);

    sort(a+,a+N+);

    for(i=;i<=N;i++){

        pos=lower_bound(a+,a+N+,K-a[i])-a;

        if(pos>i&&a[pos]==K-a[i]) printf("%d %d\n",a[i],K-a[i]),cnt++;

    }

    if(cnt==) puts("No Solution");

    return ;

}

#include<iostream>

#include<cstdio>

#include<cstdlib>

#include<algorithm>

#include<cstring>

#include<set>

using namespace std;

int k,n,a[],s,q,flag;

set<int>st;

int main()

{

    flag=;

    cin>>k>>n;

    for(int i=;i<=n;i++)

    {

        scanf("%lld",&s);

        a[i]=s;

        st.insert(s);

    }

    sort(a+,a++n);

    set<int>::iterator j;

    for(int i=;i<=n;i++)

    {

        q=k-a[i];

        j=st.find(q);

        if(j==st.end()) continue;

        else{

            if(*j>a[i])

            {

                flag=;

                printf("%d %d\n",a[i],*j);

            }

        }

    }

    if(flag==) puts("No Solution");

    return ;

}

#include<bits/stdc++.h>

#define ll long long

using namespace std;

const int maxn=;

int a[maxn];

int main()

{

    int N,i,j; ll ans=;

    scanf("%d",&N);

    for(i=;i<=N;i++) scanf("%d",&a[i]);

    sort(a+,a+N+);

    for(i=;i<=N;i++) a[i]+=a[i-],ans+=a[i];

    printf("%lld\n",ans);

    return ;

}

#include<bits/stdc++.h>

#define ll long long

using namespace std;

const int maxn=1e6+;

ll sum[maxn];

bool check(int x)

{

    if(x%==) return true;

    while(x){

        if(x%==) return true;

        x/=;

    } return false;

}

void solve()

{

    for(int i=;i<maxn;i++){

       sum[i]=sum[i-];

       if(!check(i)) sum[i]+=(ll)i*i;

    }

}

int main()

{

    solve();

    int T,N;

    scanf("%d",&T);

    while(T--){

        scanf("%d",&N);

        printf("%lld\n",sum[N]);

    }

    return ;

}

#include<bits/stdc++.h>

#define ll long long

using namespace std;
ll ans;

ll getphi(int x)

{

    int res=x;

    for(int i=;i*i<=x;i++){

        if(x%i==){

            res=res/i*(i-);

            while(x%i==) x/=i;

        }

    }

    if(x>) res=res/x*(x-);

    return res;

}

int main()

{

    int N; scanf("%d",&N);

    for(int i=;i*i<=N;i++){

        if(N%i==) {

            ans+=getphi(N/i)*i;

            if(i*i!=N) ans+=getphi(i)*(N/i);

        }

    }

    printf("%lld\n",ans);

    return ;

}

#include<bits/stdc++.h>

#define ll long long

using namespace std;

const int maxn=;

int p[maxn+],cnt;

short int vis[maxn+],mu[maxn+];

void read(int &x){

    x=; char c=getchar();

    while(c>''||c<'') c=getchar();

    while(c>=''&&c<='') x=(x<<)+(x<<)+c-'',c=getchar();

}

void Put(ll x)

{

    if(x>) Put(x/);

    putchar(x%+'');

}

void prime()

{

    mu[]=; for(int i=;i<=maxn;i++){

        if(!vis[i]) p[++cnt]=i,mu[i]=-;

        for(int j=;j<=maxn&&i*p[j]<=maxn;j++){

            vis[i*p[j]]=; mu[i*p[j]]=-mu[i];

            if(i%p[j]==) { mu[i*p[j]]=; break; }

        }

    }

}

int a[],num[maxn+];ll ans;

vector<int>G[maxn+];

int main()

{

    prime();

    int N,Q,x,i,j,Max=;

    scanf("%d%d",&N,&Q);

    for(i=;i<=N;i++) read(a[i]),Max=max(Max,a[i]),vis[i]=;

    for(i=;i<=Max;i++){

      for(j=i;j<=Max;j+=i)

         G[j].push_back(i);

    }

    while(Q--){

        read(x);

        int L=G[a[x]].size();

        if(vis[x]==){

            for(i=;i<L;i++) num[G[a[x]][i]]--;

            for(i=;i<L;i++) ans-=mu[G[a[x]][i]]*num[G[a[x]][i]];

        }

        else {

            for(i=;i<L;i++) ans+=mu[G[a[x]][i]]*num[G[a[x]][i]];

            for(i=;i<L;i++) num[G[a[x]][i]]++;

        }

        vis[x]=vis[x]^;

        Put(ans); puts("");

    }

    return ;

}