hnhbinhnd

#include <bits/stdc++.h>
#define ll long long
#define db long double
#define fi first
#define se second
#define pii pair<ll, ll>
using namespace std;

const ll MOD = 1e9+7;
const ll INF = 1e18;

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y) {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y) {
            x = y;
            return true;
        }
        return false;
    }

/*
vector<bool> is_prime(1e8, true);
vector<ll> prime;
void sang_nguyen_to(ll n)
{
  is_prime[0] = is_prime[1] = false;
  for(ll i = 2; i <= n; i++){
    if(is_prime[i]){
      prime.push_back(i);
      //cout << i << "\n";
      for(ll j = i*i; j <= n; j+=i){
        is_prime[j] = false;
      }
    }
  }
}
*/

/*
ll cong(ll a, ll b, ll c){ return ((a%c)+(b%c))%c; }
ll tru(ll a, ll b, ll c){ return ((a%c)-(b%c)+c)%c; }
ll nhan(ll a, ll b, ll c){ return ((a%c)*(b%c))%c; }

ll mul(ll a, ll b, ll mod) {
  a %= mod;
  b %= mod;
  ll res = 0;
  while(b>0)
  {
    if(b&1)
    {
      res += a;
      if (res >= mod) res -= mod;
    }
    a <<= 1;
    if (a >= mod) a -= mod;
    b >>= 1;
  }
  return res;
}


ll pow(ll a, ll n, ll mod) {
  a %= mod;
  ll res = 1%mod;
  while (n>0) {
    if (n&1) res = mul(res, a, mod);
    a = mul(a, a, mod);
    n >>= 1;
  }
  return res;
}

const ll limN = 3e5+5;

ll gt[limN] = {}, invf[limN] = {};

void calc_nd_gt(const ll &limN)
{
  gt[0] = 1;
  for(ll i = 1; i <= limN; i++)
  {
    gt[i] = gt[i-1]*i%MOD;
  }
  invf[limN] = pow(gt[limN], MOD-2, MOD);
  for(ll i = limN-1; i >= 0; i--) invf[i] = invf[i+1]*(i+1)%MOD;
}

ll C(ll n, ll k)
{
  if (n < k) return 0;
  return gt[n] * invf[k] % MOD * invf[n-k] % MOD;
}

*/

/*
struct DH {
    static const ll MOD1 = 1000000007;
    static const ll MOD2 = 91138233;
    static const ll BASE = 102;
    vector<ll> h1, h2, p1, p2;

    DH(const string& s) {
        ll n = s.size();
        h1.assign(n+1,0); 
        h2.assign(n+1,0);
        p1.assign(n+1,1); 
        p2.assign(n+1,1);
        for(ll i = 1; i <= n; i++){
            h1[i]= (h1[i-1] * BASE + s[i-1])%MOD1;
            h2[i]= (h2[i-1] * BASE + s[i-1])%MOD2;
            p1[i]= p1[i-1] * BASE%MOD1;
            p2[i]= p2[i-1] * BASE%MOD2;
        }
    }

    pair<ll,ll> get(ll l,ll r){
        ll x=(h1[r]-h1[l-1]*p1[r-l+1]%MOD1+MOD1)%MOD1;
        ll y=(h2[r]-h2[l-1]*p2[r-l+1]%MOD2+MOD2)%MOD2;
        return {x,y};
    }
};

struct Hash{
    static const ll MOD = 1000000007;
    static const ll BASE = 91138233;

    vector<ll> h, p;

    Hash(const string& s) {
        ll n = s.size();
        h.assign(n+1, 0);
        p.assign(n+1, 1);

        for (ll i = 1; i <= n; i++) {
            h[i] = (h[i-1] * BASE + s[i-1]) % MOD;
            p[i] = (p[i-1] * BASE) % MOD;
        }
    }

    long long get(ll l, ll r) {
        return (h[r] - h[l-1] * p[r-l+1] % MOD + MOD) % MOD;
    }
};
*/

int main() 
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    // freopen(".inp", "r", stdin);
    // freopen(".out", "w", stdout);

    return 0;
}

// Author: hnhbinhnd

import sys
import math
from random import randint
# sys.stdin = open(".inp")
# sys.stdout = open(".out", "w")

print(randint(1, 156))
# Who gets number 102 will win XD