#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin >> N;
    map<string, bool> mp;
    string ans = "satisfiable";
    while(N--) {
        string s;
        cin >> s;
        if(ans != "satisfiable") continue;
        bool exist = (s[0] == '!' ? true : false);
        if(exist) s.erase(s.begin());
        if(mp.count(s) && mp[s] != exist) ans = s;
        mp[s] = exist;
    }
    cout << ans << '\n';


    return 0;
}

#include "bits/stdc++.h"
using namespace std;

#define FAST cin.tie(nullptr)->sync_with_stdio(false);
#define PRECISE cout << fixed << setprecision(19);
#define ONE int tc = 1;
#define GO for (int i = 0; i < tc; ++i) { solve(); }

using vi = vector<int>;

#define all(x) (x).begin(), (x).end()

#define ice(i, a, b) for (int (i) = (a); (i) < (b); ++(i))

void solve() {
    int n; cin >> n;
    vi a(n), b(n);
    ice(i, 0, n) {
        cin >> a[i];
    }
    ice(i, 0, n) {
        cin >> b[i];
    }
    cout << max(0, *min_element(all(b)) - *max_element(all(a)) + 1);
}

int main() {
    FAST PRECISE ONE GO
}