// C - Duodecim Ferra
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define vec vector
#define rp(i,s,e) for(ll i=(s);i<(e);++i)

// 素数と個数を求める
vector<pair<ll,ll>> factorize(ll n){
	vec<pair<ll,ll>> res;
	for(ll i=2L; i*i<=n; ++i){
		if (n%i) continue;
		res.emplace_back(i,0);
		while(n%i == 0){
			n /= i;
			res.back().second++;
		}
	}
	if(n != 1) res.emplace_back(n,1L);
	return res;
}

ll nCr(ll n, ll r){
	if(n-r < r) r = n - r;
	vec<int> c(n+1);
	ll ret = 1;
	for(ll i=n; i>=n-r+1; --i){
		auto pc = factorize(i);
		for(auto x:pc) c[x.first] += x.second;
	}
	rp(i, 1, r+1){
		auto pc = factorize(i);
		for(auto x:pc) c[x.first] -= x.second;
	}
	rp(p, 1, n+1){
		if(c[p] > 0){
			while(c[p]--) ret *= p;
		}
	}
	return ret;
}

int main() {
	ll L; cin>>L;
	cout<< nCr(L-1, 11) <<endl;
}

//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")
//#pragma GCC optimize("branch-target-load-optimize")
//#pragma GCC optimize("branch-target-load-optimize2")
//#pragma GCC optimize("btr-bb-exclusive")

#include <iostream>
#include <map>
#include <vector>
#include <set>
#include <stack>
#include <bitset>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <cassert>
#include <random>

using namespace std;

void solve();

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    solve();
}

#define int long long

const int N = 5e5 + 100, K = 3e5, A = 2e5 + 100, MOD = 1e9 + 7, base = 131, INF = 1e18;

int n;
vector < string > s;
set < string > se;

void solve() {
    cin >> n;
    s.resize(n);
    for (int i = 0; i < n; i++) {
        cin >> s[i];
        se.insert(s[i]);
    }
    for (int i = 0; i < n; i++) {
        if (se.count("!" + s[i])) {
            cout << s[i];
            return;
        }
    }
    cout << "satisfiable";
}

