#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define nl '\n'
//#define int long long
const int N = 2e5 + 100;
const int mod = 1e9 + 7;
ll fact[N];
ll inv[N]; //mod inverse for i
ll invfact[N]; //mod inverse for i!
void factInverse()
{
fact[0] = inv[1] = fact[1] = invfact[0] = invfact[1] = 1;
for (long long i = 2; i < N; i++)
{
fact[i] = (fact[i - 1] * i) % mod;
inv[i] = mod - (inv[mod % i] * (mod / i) % mod);
invfact[i] = (inv[i] * invfact[i - 1]) % mod;
}
}
ll nCr(int n, int r)
{
if (r > n) return 0;
return (((fact[n] * invfact[r]) % mod) * invfact[n - r]) % mod;
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgIGxsIGxvbmcgbG9uZwojZGVmaW5lICBubCAnXG4nCi8vI2RlZmluZSAgaW50IGxvbmcgbG9uZwoKCmNvbnN0IGludCBOID0gMmU1ICsgMTAwOwpjb25zdCBpbnQgbW9kID0gMWU5ICsgNzsKbGwgZmFjdFtOXTsKbGwgaW52W05dOyAvL21vZCBpbnZlcnNlIGZvciBpCmxsIGludmZhY3RbTl07IC8vbW9kIGludmVyc2UgZm9yIGkhCnZvaWQgZmFjdEludmVyc2UoKQp7CiAgICBmYWN0WzBdID0gaW52WzFdID0gZmFjdFsxXSA9IGludmZhY3RbMF0gPSBpbnZmYWN0WzFdID0gMTsKICAgIGZvciAobG9uZyBsb25nIGkgPSAyOyBpIDwgTjsgaSsrKQogICAgewogICAgICAgIGZhY3RbaV0gPSAoZmFjdFtpIC0gMV0gKiBpKSAlIG1vZDsKICAgICAgICBpbnZbaV0gPSBtb2QgLSAoaW52W21vZCAlIGldICogKG1vZCAvIGkpICUgbW9kKTsKICAgICAgICBpbnZmYWN0W2ldID0gKGludltpXSAqIGludmZhY3RbaSAtIDFdKSAlIG1vZDsKICAgIH0KfQoKbGwgbkNyKGludCBuLCBpbnQgcikKewogICAgaWYgKHIgPiBuKSByZXR1cm4gMDsKICAgIHJldHVybiAoKChmYWN0W25dICogaW52ZmFjdFtyXSkgJSBtb2QpICogaW52ZmFjdFtuIC0gcl0pICUgbW9kOwp9CgpzaWduZWQgbWFpbigpCnsKICAgIGlvczo6c3luY193aXRoX3N0ZGlvKDApOwogICAgY2luLnRpZSgwKTsKICAgIGNvdXQudGllKDApOwoKCiAgICByZXR1cm4gMDsKfQo=