#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; #define FOR(i,l,r) for(ll i=l;i=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define PA pair #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) #include namespace mp=boost::multiprecision; using Bint=mp::cpp_int; templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vector&v){REP(i,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(bQ; FOR(i,2,700)FOR(j,1,i)if(__gcd(i,j)==1)Q.emplace_back(PA(j,i)); sort(ALL(Q),f); Q.resize(N/8); vectorR(N); ll x=0,y=0; REP(i,N/8)y+=Q[i].S; x=y;y=0; REP(i,N/8){ R[i]=PA(x,y); x-=Q[i].F; y+=Q[i].S; } R[N/8]=PA(x,y); FOR(i,N/8+1,N/4){ R[i]=R[N/4-i]; swap(R[i].F,R[i].S); } REP(i,N/4){ R[i+N/4]=PA(-R[i].S,R[i].F); R[i+N/2]=PA(-R[i].F,-R[i].S); R[i+N*3/4]=PA(-R[i].S,-R[i].F); } REP(i,N)cout<