Go_to_Hell

//actually this is also a contest template for c++ which I use with sublime text
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace   std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;

typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

#define     sz                 size()
#define     pb                 push_back
#define     inf                (1<<30)
#define     mod                (1000000007)
#define     pi                 (acos(-1.0))
#define     rep(i, n)          for(__typeof(n) i=0; i<(n); i++)
#define     foab(i, a, b)      for(__typeof(b) i=(a); i<=(b); i++)
#define     foba(i, a, b)      for(__typeof(b) i=(b); i>=(a); i--)
#define     foch(it, l)        for(__typeof((l).begin()) it = (l).begin();  it != (l).end(); ++it)
#define     what_is_x(x)       cout << (#x) << " is " << (x) << endl;

template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> ostream& operator<<(ostream& os, const vector<T> &t) { ll n = t.size(); rep(i, n) os<<t[i]<<" "; return os; }
template<typename T,typename TT> ostream& operator<<(ostream &os, const pair<T,TT> &t) { return os<<"("<<t.first<<","<<t.second<<")"; }
/**__________________________________________________________________________________________________________________________________*/





int main(){
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);





    return 0;

}