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

#define int long long
#define endl "\n"
#define F first
#define S second
#define pii pair<int, int>
#define sz(x) (int) (x.size())

// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

// template<typename T> using o_set = tree<T, null_type, std::less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 2e5 + 10;
const int mod = 1e9 + 7;
const int INF = 1e18 + 10;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


void solve() {
    int n; cin>>n;
    cout<<0<<endl;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1; //cin>>t;
    for(int tc = 1; tc <= t; tc++) {
        // cerr<<"Case "<<tc<<":\n";
        solve();
    }
}