#include "bits/stdc++.h"
using namespace std;

using ld = long double;
using ll = long long;

#define F first
#define S second
#define s(x) set<x>
#define um(x, y) unordered_map<x, y>
#define m(x, y) map<x, y>
#define p(x, y) pair<x, y>
#define v(x) vector<x>
#define min_heap(t) priority_queue<t, vector<t>, greater<t>>
#define max_heap(t) priority_queue<t>

#define eb emplace_back
#define mp make_pair
#define pb push_back
#define bs binary_search
#define lb lower_bound
#define ub upper_bound

#define all(v) v.begin(), v.end()
#define ss(v) stable_sort(all(v))
#define fori(i, a, b) for (int i = a; i <= b; i++)
#define rofi(i, a, b) for (int i = a; i >= b; --i)
#define R(x) reverse(all(x));

const char nl = '\n';
const char sp = ' ';
const int mod1 = 1e9 + 7;
const int mod2 = 998244353;
const ld PI = acos(-1);

#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define stprs(x) cout << fixed << setprecision(x);


class A {
public:

    A() {
        for(int i = 1; i <= 2; ++i) {
            char output[8] = "output_";
            output[7] = i + '0';
            char input[7] = "input_";
            input[6] = i + '0';
            freopen(input,"r",stdin);
            freopen(output,"w",stdout);
            test_case();
        }
    }

    void test_case() {
        int t = 1;
        // cin >> t;
        while (t--) {
            solve();
        }
    }

    void solve() {

    }
};

int32_t main() {
    fastio;
    A a;
    return 0;
}