Contest Template-02
/// Md.ASADUZZAMAN
/// Dept of ICT
/// MBSTU
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define fr(i,a,b) for(int i=(a);i<(b);i++)
#define rfr(i,a,b) for(int i=(b-1);i>=(a);i--)
#define freach(i, c) for( __typeof( (c).begin() ) i = (c).begin(); i != (c).end(); ++i )
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define forit(it, s) for(__typeof(s.begin()) it = s.begin(); it != s.end(); it++)
#define PINF INT_MAX
#define MINF INT_MIN
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define mset(a,c) memset(a,c,sizeof a)
#define clr(a) memset(a,0,sizeof a)
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pcc pair<char,char>
#define pic pair<int,char>
#define pci pair<char,int>
#define psi pair<sting,int>
#define pis pair<int,string>
#define ff first
#define ss second
#define vs vector<string>
#define vi vector<int>
#define vll vector<long long>
#define vpi vector<pair<int,int> >
#define vpl vector<pair<long long,long long> >
#define qi queue<int>
#define ql queue<long>
#define qll queue<long long>
#define PQ priority_queue
#define mpii map<int,int>
#define mpsi map<string,int>
#define mpci map<char,int>
#define mpll map<long long,long long>
#define stl set<ll>
#define sts set<string>
/// Bug
#define bug(x) cout<<#x<<": "<<x<<endl
#define bug1(x,y) cout<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define bug2(x,y,z) cout<<#x<<": "<<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define bug3(w,x,y,z) cout<<#w<<": "<<w<<" | "<<#x<<": "<<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
/// Trigonometry
#define pi acos(-1.0)
#define rad(x) (((1.0 * x * pi) / 180.0))
#define deg(x) (((x * 180.0) / (1.0 * pi)))
#define sinr(x) (sin(rad(x)))
#define cosr(x) (cos(rad(x)))
#define tanr(x) (tan(rad(x)))
#define asind(x) (deg((asin(x))))
#define acosd(x) (deg((acos(x))))
#define atand(x) (deg((atan(x))))
///Bit
#define setbiton(x, i) (x |= (1 << i))
#define setbitoff(x, i) (x &= (~(1 << i)))
#define togglebit(x, i) (x ^= (1 << i))
#define checkbiton(x,i) ((x &(1 << i))!=0)
#define ispow2 (x!=0 && (x&(x-1))==0)
#define countbit(x) __builtin_popcountll((ll)x)
#define countlead(x) __builtin_clzll((ll)x) ///give wrong ans for zero (0)
#define counttrail(x) __builtin_ctzll((ll)x) ///give wrong ans for zero (0)
/// Search
#define LB(a,x) (lower_bound(all(a),x)-a.begin()) // first element in the range [first,last) which does not compare less than val.
#define UB(a,x) (upper_bound(all(a),x)-a.begin()) // first element in the range [first,last) which compares greater than val.
#define bin_sa(a,n,x) (binary_search(a, a+n,x))
#define bin_sv(v,x) (binary_search(v.begin(), v.end(),x))
/// Algorithm
#define Unique(store) store.resize(unique(store.begin(),store.end())-store.begin())
#define mxe(a,n) (*max_element(a,a+n))
#define mxv(v) (*max_element(v.begin(), v.end()))
#define mne(a,n) (*min_element(a,a+n))
#define mnv(v) (*min_element(v.begin(), v.end()))
#define SUM(a,n) (accumulate(a,a+n,0))
#define SUMv(v) (accumulate(v.begin(), v.end(), 0))
#define occurx(v,x) (count(v.begin(), v.end(),x))
#define findx(v,x) (find(v.begin(), v.end(),x))
#define swap(a,b) a^=b^=a^=b
#define sgn(x,y) ((x)+eps<(y)?-1:((x)>eps+(y)?1:0))
///I/O
#define input() freopen("in0.txt","r",stdin)
#define output()freopen("out0.txt","w",stdout)
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ppc(x,y) cout<<fixed<<setprecision(y)<<x<<endl
#define IN scanf
#define OUT printf
/// #define SI(a) scanf("%d",&a)
/// #define SL(a) scanf("%lld",&a)
/// #define SD(a) scanf("%lf",&a)
/// #define OI(a) printf("%d",a)
/// #define OL(a) printf("%lld",a)
/// #define OD(a) printf("%lf",a)
/// #define ON() printf("\n")
///Parse
template<typename T>inline string toString(T a){ ostringstream os("");os<<a;return os.str();}
template<typename T>inline ll toLong(T a){ll res;istringstream os(a);os>>res;return res;}
template<typename T>inline int toInt(T a){int res;istringstream os(a);os>>res;return res;}
template<typename T>inline double toDouble(T a){double res;istringstream os(a);os>>res;return res;}
template<typename T>inline vs vs_parse(T str){vs res;string s;istringstream os(str);while(os>>s)res.pb(s);return res;}
///Mathematics
template<typename T>inline T sqr(T a){return a*a;}
template<typename T>inline T pw(T b,T p){T r=1;if(b==0)return 0;fr(i,0,p)r*=b;return r;}
template< typename T > inline T gcd(T a,T b){a=abs(a);b=abs(b);if(!b) return a;return __gcd(b,a%b);}
template<typename T> inline T lcm(T a,T b){a=abs(a);b=abs(b);return (a/__gcd(a,b))*b;}
template<typename T>inline ull bigmod(T a, T b, T m){if (b == 0)return 1;else if (b % 2 == 0)return sqr(bigmod(a, b / 2, m)) % m;else return (a % m*bigmod(a, b - 1, m)) % m;}
template<typename T> inline T modinv(T n,T mod){return bigmod(n,mod-2,mod);}
///Geometry
template<typename T>inline ull dist(T A,T B){ull res=(A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y);return res;}
template<typename T>inline ll cross(T A,T B,T C){return (B.x-A.x)*(C.y-A.y)-(C.x-A.x)*(B.y-A.y);}
template<typename T>inline double cosangle(T a,T b,T c){double res=a*a+b*b-c*c;res=res/(2*a*b);res=acos(res);return res;}
///Inside grid
template<typename T>inline bool isinside_grid(int R,int C,int ro,int clm){if((R>=0&&R<ro)&&(C>=0&&C<clm))return true;return false;}
template<typename T>inline void print_grid(T GRID,int ro,int clm){fr(i,0,ro){fr(j,0,clm)cout<<GRID[i][j]<<" ";puts("");}}
template<typename T>inline void extended_euclid(T a,T b,T &x,T &y)
{if(!b){x = 1, y = 0 ;return ;}ll xx,yy;extended_euclid(b,a%b,xx,yy);x = yy;y = xx - (a/b)*yy;}
template<typename T>inline pair<ll, pair<ll, ll> > extendedEuclid(ll a, ll b)
{ ll x = 1, y = 0,xLast = 0, yLast = 1,q, r, m, n;
while(a != 0){q = b / a;r = b % a;m = xLast - q * x;n = yLast - q * y;xLast = x, yLast = y;x = m, y = n;b = a, a = r;}
return make_pair(b, make_pair(xLast, yLast));
}
///Direction array
int x4[] = {0, 1, 0, -1};
int y4[] = {-1, 0, 1, 0};
int x8[] = { -1, -1, 1, 1, -2, -2, 2, 2 };
int y8[] = { 2, -2, 2, -2, 1, -1, 1, -1 };
///----------------------Main Code-------------------------------------///
#define EPS 1e-9
#define inf 1e18
#define MOD 1000000007
int main()
{
#ifndef ONLINE_JUDGE
//input();
//output();
#endif
fast();
// clock_t begin, end;
// double time_spent;
// begin = clock();
ll n,x,y,a,b,c,t,q;
string s;
//char c;
//cin>>t;
while(cin>>n)
{
}
// end = clock();
// time_spent = (double)(end - begin) / CLOCKS_PER_SEC;
// cout<<"Time spent = "<<time_spent<<endl;
return 0;
}
