#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <stack>
#include <cstdio>
#include <cmath>
#include <bitset>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int, ll> P;
typedef pair<ll, P> Pl;
 
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
#define rep1(i,x) for(int i=1;i<=x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rrep1(i,x) for(int i=x;i>0;i--)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end())
#define ub(vec,a) upper_bound(vec.begin(),vec.end())
#define uniq(vec) vec.erace(unique(vec.begin(),vec.end(),vec.end))
#define mp1(a,b,c) P1(a,P(b,c))
const int INF = 1 << 29;
const double EPS = 1e-9;
 
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

ll ans;
int a[5]={3,5,17,257,65537};
ll k=1;
int main(){
    cout<<"30"<<endl;
    return 0;
}