#include<bits/stdc++.h> #define reg register int #define il inline #define fi first #define se second #define mk(a,b) make_pair(a,b) #define numb (ch^'0') using namespace std; typedef long long ll; template<class T>il void rd(T &x){ char ch;x=0;bool fl=false; while(!isdigit(ch=getchar()))(ch=='-')&&(fl=true); for(x=numb;isdigit(ch=getchar());x=x*10+numb); (fl==true)&&(x=-x); } template<class T>il void output(T x){if(x/10)output(x/10);putchar(x%10+'0');} template<class T>il void ot(T x){if(x<0) putchar('-'),x=-x;output(x);putchar(' ');} template<class T>il void prt(T a[],int st,int nd){for(reg i=st;i<=nd;++i) ot(a[i]);putchar(' ');} namespace Miracle{ const int N=1e6+6; int miu[N],vis[N]; int pri[N],tot; void sieve(int n){ miu[1]=1; for(reg i=2;i<=n;++i){ if(!vis[i]){ pri[++tot]=i;miu[i]=-1; } for(reg j=1;j<=tot;++j){ if(pri[j]*i>n) break; vis[pri[j]*i]=1; if(i%pri[j]==0){ miu[i*pri[j]]=0; break; } miu[i*pri[j]]=-miu[i]; } } for(reg i=2;i<=n;++i) miu[i]+=miu[i-1]; } map<int,int>mp; void dj(int n){ } int main(){ } } signed main(){ Miracle::main(); return 0; } /* Author: *Miracle* Date: 2019/3/20 22:05:20 */