#include <bits/stdc++.h>
#define endl '\n'
#define fr first
#define sc second
#define all(v) v.begin(),v.end()
#define bout(x) cout << bitset<sizeof(x)*8>(x) << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, ddy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int nx[8] = {1, 2, 2, 1, -1, -2, -2, -1}, ny[8] = {-2, -1, 1, 2, 2, 1, -1, -2};

string arr[200020];
set<string> s1, s2;

void Main(){
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++){
		cin >> arr[i];
		int len = arr[i].size();
		if (arr[i][0] == '!'){
			string tmp = "";
			for (int j = 1; j < len; j++){
				tmp += arr[i][j];
			}
			arr[i] = tmp;
			s2.insert(arr[i]);
		}
		else{
			s1.insert(arr[i]);
		}
	}
	for (int i = 1; i <= n; i++){
		if (s1.count(arr[i]) && s2.count(arr[i])){
			cout << arr[i];
			return;
		}
	}
	cout << "satisfiable";
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cout.setf(ios::fixed);
	cout.precision(0);
	Main();
}

#include <iostream>
#include <cmath>

using namespace std;

 int main()
{
    int  n;
    cin >> n;
    int a;
    int ans = 0;

    for(int i = 0;i < n;i++){
        cin >> a;
        if( a > 10){
             ans = ans + a - 10;
        }
    }
    cout << ans;
   return 0;
}



