#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
const ll INF = 1001001001;
void chmin(ll& a,ll b){if(a>b)a = b;}

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])){
            cout << S[i] << endl;
            return 0;
        }
    }
    cout << "satisfiable" << endl;
    return 0;

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

// template {{{
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;

#define  range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)
#define rrange(i, l, r) for (i64 i = (i64)(r) - 1; i >= (i64)(l); (i) -= 1)

#define  whole(f, x, ...) ([&](decltype((x)) container) { return (f)(  begin(container),  end(container), ## __VA_ARGS__); })(x)
#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)

#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl

constexpr i32 inf   = 1001001001;
constexpr i64 infll = 1001001001001001001ll;

constexpr i32 dx[] = {0, -1, 1, 0, -1, 1, -1, 1}; 
constexpr i32 dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};

struct IoSetup { IoSetup(i32 x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;

template <typename T = i64> T input() { T x; cin >> x; return x; }

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != (int)v.size() ? " " : ""); } return os; } 
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }

template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }

template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// }}}

pair<int, int> diam_dfs(int v, int p, int dep, const vector<vector<int>> &G, vector<pair<int, int>> &ds) {
  pair<int, int> res(dep, v);
  for (auto &u : G[v]) {
    if (u == p) continue;
    chmax(res, diam_dfs(u, v, dep + 1, G, ds));
  }

  ds[v] = res;
  return res;
}

void dfs(int v, int p, int &e, const vector<vector<int>> &G, const vector<pair<int, int>> &ds, vector< int > &ans) {
  ans[v] = e;

  vector< pair<int, int> > us;
  for (auto &u : G[v]) {
    if (u == p) continue;
    us.emplace_back(ds[u].first, u);
  }

  whole(sort, us);
  for (auto &[d, u] : us) {
    e++;
    dfs(u, v, e, G, ds, ans);
    e++;
  }
}

void solve() {
  int n = input();

  vector< vector< int > > G(n);
  range(i, 1, n) {
    int a = input() - 1, b = input() - 1;
    G[a].emplace_back(b);
    G[b].emplace_back(a);
  }

  vector< pair<int, int> > ds(n);
  auto [d0, v0] = diam_dfs(0, -1, 0, G, ds);
  diam_dfs(v0, -1, 0, G, ds);

  int e = 1;
  vector< int > ans(n);
  dfs(v0, -1, e, G, ds, ans);

  cout << ans << endl;
}

signed main() {
  solve();
}
