 #include<bits/stdc++.h>
#include<stdlib.h>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<queue>
#include<time.h>
#include <cstdio>
#include <iostream>
#include <vector>
#define ll long long
#define int long long
#define inf 0x3f3f3f3f
#define mods 1000000007
#define modd 998244353
#define PI acos(-1)
#define fi first
#define se second
#define lowbit(x) (x&(-x))
#define mp make_pair
#define pb push_back
#define si size()
#define E exp(1.0)
#define fixed cout.setf(ios::fixed)
#define fixeds(x) setprecision(x)
#define IOS ios::sync_with_stdio(false);cin.tie(0)
 using namespace std;
 ll gcd(ll a,ll b){if(a<0)a=-a;if(b<0)b=-b;return b==0?a:gcd(b,a%b);}
template<typename T>void read(T &res){bool flag=false;char ch;while(!isdigit(ch=getchar()))(ch=='-')&&(flag=true);
for(res=ch-48;isdigit(ch=getchar());res=(res<<1)+(res<<3)+ch - 48);flag&&(res=-res);}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
ll qp(ll a,ll b,ll mod){ll ans=1;if(b==0){return ans%mod;}while(b){if(b%2==1){b--;ans=ans*a%mod;}a=a*a%mod;b=b/2;}return ans%mod;}//快速幂%
ll qpn(ll a,ll b, ll p){ll ans = 1;a%=p;while(b){if(b&1){ans = (ans*a)%p;--b;}a =(a*a)%p;b >>= 1;}return ans%p;}//逆元   (分子*qp(分母,mod-2,mod))%mod;

map<string,ll>sb;

 string b[222222];
signed main(){

ll n;
read(n);
for(int i=1;i<=n;i++){

    cin>>b[i];
    //string c="!";
    if(b[i][0]!='!'){
   // c=c+b[i];
    //sb[c]++;
    continue;
    }
    else{
        sb[b[i]]++;
    }
}

for(int i=1;i<=n;i++){
 if(b[i][0]!='!'){
    string c="!";
    c=c+b[i];
    if(sb[c]!=0){
        cout<<b[i];
        return 0;
    }

 }


}

cout<<"satisfiable";






}

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

int main() {
  int i, N, sum=0;
  cin >> N;
  vector<int> A(N);
  vector<int> B(N);
  for (i = 0; i < N; i++) {
  	cin >> A.at(i);
  }
  for (i = 0; i < N; i++) {
  	cin >> B.at(i);
  }
  for(i = 0; i < N; i++) {
    sum += A.at(i) * B.at(i);
  }
  if(sum == 0){
    cout << "Yes" << endl;
  }else{
    cout << "No" << endl;
  }
}