/*

written by Pankaj Kumar.

country:-INDIA

Institute: National Institute of Technology, Uttarakhand

*/

#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace std;

using namespace __gnu_pbds;

typedef long long ll ;

typedef vector<ll> vl;

#define speed cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);

/* Abbrevations */

#define ff first

#define ss second

#define mp make_pair

#define line cout<<endl;

#define pb push_back

#define Endl "\n"

// loops

#define forin(arr,n) for(ll i=0;i<n;i++) cin>>arr[i];

// Some print

#define no cout<<"NO"<<endl;

#define yes cout<<"YES"<<endl;

// sort

#define all(V) (V).begin(),(V).end()

#define srt(V) sort(all(V))

#define srtGreat(V) sort(all(V),greater<ll>())

// some extra

#define printv(v) for(ll i=0;i<ll(v.size());i++){cout<<v[i]<<" ";} line;

#define precision(x) cout<<fixed<<setprecision(x);

#define sz(V) ll(V.size())

// template

template <typename T>

T mymax(T x,T y)

{

return (x>y)?x:y;

}

// function

ll power(ll x,ll y,ll mod)

}

ll str_to_num(string s)

{

return stoi(s);

}

string num_to_str(ll num)

{

return to_string(num);

}

// datatype definination

#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>

class Point

};

/* ascii value

A=65,Z=90,a=97,z=122

*/

/* --------------------MAIN PROGRAM----------------------------*/

// to run ctrl+b

ll solve()

}

int main()

}

/* -----------------END OF PROGRAM --------------------*/

/*

* stuff you should look before submission

* constraint and time limit

* int overflow

* special test case (n=0||n=1||n=2)

* don't get stuck on one approach if you get wrong answer

*/