#include <bits/stdc++.h>

using namespace std;

int solve(vector <int> A) {
    //  Return the length of the longest possible sequence of moves modulo 10^9+7.
    return 30;
}

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    int result = solve(A);
    cout << result << endl;
    return 0;
}