#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <ctype.h>
#include <climits>
#include <queue>
#include <iostream>
#include <string>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
// using ll = long long;
//using P = pair<int,int>;

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

    rep(i,n) {
        if(s_set.count("!" + s[i])) {
            cout << s[i] << endl;
            return 0;
        }
    }
    cout << "satisfiable" << endl;
    return 0;
}
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define int long long int
#define popcount(x) __builtin_popcountll(x)
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define sc second
#define pb push_back
#define fr first
#define all(a) (a).begin(),(a).end()
#define mem0(a) memset(a,0,sizeof(a))
#define ld long double
const int INF = __LONG_LONG_MAX__;
#define rall(a) (a).rbegin(),(a).rend()
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroint-loops")

int power(int a,int b,int m)
{
  int res=1;
  while(b)
  {
    if(b&1) res=((res%m)*(a%m))%m;
    a=((a%m)*(a%m))%m;
    b>>=1;
  }
  return res;
}

int power(int a,int b)
{
  int res=1;
  while(b)
  {
    if(b&1) res*=a;
    a*=a;
    b>>=1;
  }
  return res;
}

bool isPowerOfTwo(int x)
{
    // x will check if x == 0 and !(x & (x - 1)) wiint check if x is a power of 2 or not
  return (x && !(x & (x - 1)));
}


void solve()
{
  int n;
  cin>>n;
  int ans=1;
  for(int i=2;i<=n;i++)
  {
    ans=(ans*i)/__gcd(i,ans);
  }
  ans++;
  cout<<ans;
}


signed main()
{
  fastio
  int tt=1;
  // cin>>tt;
  //  freopen("input.txt", "r" , stdin);
  // freopen("output.txt", "w", stdout);
  while(tt--)
  {
    solve();
    cout<<"\n";
  }
  return 0;
}