#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <limits>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <random>

#ifdef DEBUG
#include "library/Utility/debug.cpp"
#else
#define debug(...)
#endif

#define rep(i,n) for(int i=0;i<(n);++i)
#define EL '\n'
#define print(i) std::cout << (i) << '\n'
#define all(v) (v).begin(), (v).end()
using lnt = long long;
struct FIO{FIO(){std::cin.tie(0);std::ios_base::sync_with_stdio(0);std::cout<<std::fixed<<std::setprecision(15);}}fIO;
template<typename T> using V = std::vector<T>;
template<typename T> void fill(V<T>&v) { for(T&e:v) std::cin >> e; }
/*-*/

int main() {
	int x;
	std::cin >> x;
	print(std::max(x,0));
}

#pragma warning(disable: 4996)
#include <string>
#include <vector>
#include <iostream>
#include <cstdio>
#include <sstream>
#include <fstream>
#include <math.h>
#include <algorithm>
#include <map>
#include <bitset>
#include <queue>

using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); i++)

const ll INF = 1e9 + 7;

int main() {
    int n;
    cin >> n;
    string s;
    map<string, int> mp1, mp2;
    rep(i, n) {
        cin >> s;
        mp1[s]++;
        if (mp1[s] == 1) {
            if (s[0] == '!') {
                s.erase(0,1);
            }
            mp2[s]++;
        }
    }
    string ans = "satisfiable";
    for (auto u : mp2) {
        if (u.second >= 2) {
            ans = u.first;
        }
        //cout << u.first << endl;
    }

    cout << ans << endl;

    return 0;
}