#include<bits/stdc++.h>
using namespace std;
 
#define noOfDigits(n) ((int)log10(n) + 1)
#define ll long long
#define ull unsigned long long
#define ld long double
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define vi vector<int>
#define vll vector<ll>
#define vi2d(n,m,grid) vector<vector<int>> grid(n, vector<int> (m, 0))
#define in(v) for(auto &i : v) cin >> i
#define fi(n) for(int i = 0; i < n; ++i)
#define mxx(v) *max_element(all(v))
#define mnn(v) *min_element(all(v))
 
void FILES (){
    freopen ( "window.in" , "r" , stdin ) ;
    freopen ( "number2.out" , "w" , stdout ) ;
}
ull sumFrom1ToN(int n) { return (ull)n * (n + 1) / 2; }
ull sumFromAtoB(ll a, ll b) { return (max(a, b) - min(a, b) + 1) * (a + b) / 2; }

bool isPrime(ull val) {
    if (val == 0 || val == 1) return false;
    for (ll i = 2; i * i <= val; i++) {
        if (val % i == 0) return false ;
    }
    return true ;
}
vll getDivisors(ll n) {
    vll v;
    for (int i = 1; i * i <= n; ++i) {
        if (n % i == 0) {
            v.push_back(i); v.push_back(n / i);
        }
    }
    sort(all(v));
    return v;
}
bool isLucky(ull n) {
    if (n <= 0) return false;
    while (n > 0) {
        if ((n % 10 != 7) && (n % 10 != 4)) return false;
        n /= 10;
    }
    return true;
}

string toBinary (ll decimal) {
    string s;
    while (decimal) {
        s += to_string(decimal % 2);
        decimal /= 2;
    }
    return s ;
}
ll sumV(vector<int> &v) {
    return (long long)accumulate(v.begin(), v.end(), (long long)0);
}
void solve() {
    int n; cin >> n;
    vi v(n);

}
int main() {
    FAST
//    FILES();
    int T = 1;
//    cin >> T;
    while (T--) {
        solve();
    }
}