#include <bits/stdc++.h>
    using namespace std;
    #include <math.h>
    #include <iomanip>
    #include <cstdint>
    #include <string>
    #include <sstream>
    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
    #define rep(i,n) for (int i = 0; i < (n); ++i)
    typedef long long ll;
    typedef unsigned long long ull;
    using P=pair<ll,ll>;
    const ll INF=1e18;
    const int mod=998244353;
    
    struct Unionfind{
      vector<int>d;
      Unionfind(int n):d(n,-1){}
      int root(int x){
        if(d[x]<0){return x;}
        return d[x]=root(d[x]);
      }
      bool unite(int x,int y){
        x=root(x);y=root(y);
        if(x==y){return false;}
        if(d[x]>d[y]){swap(x,y);}
        d[x]+=d[y];
        d[y]=x;
        return true;
      }
      bool same(int x,int y){return root(x)==root(y);}
      int size(int x){return -d[root(x)];}
    };

    void solve(){
        int n;
        cin>>n;
        int m=n*(n-1)/2;
        vector<int>a(m),b(m);
        vector<string>c(m);
        vector<pair<string,pair<int,int>>>tp(m);
        rep(i,m){
            cin>>a[i]>>b[i]>>c[i]; 
            a[i]--;b[i]--; 
            tp[i]=make_pair(c[i],make_pair(a[i],b[i]));
        }
        
        auto f=[&](string a,string b){
            if(a.size()!=b.size()){
               return a.size()<=b.size();
            }
            return a<=b;
        };
        
        sort(tp.begin(),tp.end(),[&](auto a,auto b){
            return f(a.first,b.first);
        });
        
        auto check=[&](int mid){
            Unionfind uf(n);
            string mx=tp[mid].first;
            rep(i,m){
                if(f(tp[i].first,mx)){
                    uf.unite(tp[i].second.first,tp[i].second.second);
                }
            }
            return uf.size(0)==n;
        };

        int l=-1,r=m-1;
        while(r-l>1){
            int mid=(l+r)/2;
            if(check(mid)){r=mid;}
            else{l=mid;}
        }
        cout<<tp[r].first<<endl;
    }

    int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        solve();  

        return 0;
    }