#include <iostream>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;

int main() {
    int n;
    cin >> n;
    vector<string> s(n);
    set<string> sset;
    rep(i, n) { 
        cin >> s[i];
        sset.insert(s[i]);
    }

    rep(i, n) {
        if (sset.count("!" + s[i]) >= 1) {
            cout << s[i] << endl;
            return 0;
        }
    }

    cout << "satisfiable" << endl;
    return 0;
}
#include <bits/stdc++.h>
using namespace std;

int main(){
  int n;
  cin >> n;
  map<string,int> mp, mp2;
  for(int i=0; i<n; ++i){
    string s;
    cin >> s;
    if(s[0] == '!'){
      mp2[s.substr(1)]++;
    }else{
      mp[s]++;
    }
  }
  for(auto p:mp){
    if(mp2[p.first]){
      cout << p.first << endl;
      return 0;
    }
  }
  cout << "satisfiable" << endl;
  return 0;
}