#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 2000000
#define MOD 1000000007
#define INF 1000000000000000000

vector<int> parent;
vector<int> cnt;
int find(int x){
  int y=parent[x];
  if(y!=parent[y]){
    y=find(y);
  }
  return parent[x]=y;
}
void unite(int a,int b){
  int x=find(a);
  int y=find(b);
  if(x!=y){
    parent[y]=x;
    cnt[x]+=cnt[y];
  }
}

int main(){
  int N;
  cin>>N;
  vector<int> a(N*(N-1)/2),b(N*(N-1)/2);
  vector<string> C(N*(N-1)/2);
  for(int i=0;i<N*(N-1)/2;i++){
    cin>>a[i]>>b[i]>>C[i];
    a[i]--;
    b[i]--;
  }
  parent.resize(N);
  iota(parent.begin(),parent.end(),0);
  cnt.resize(N,1);
  for(int i=0;i<N*(N-1)/2;i++){
    unite(a[i],b[i]);
    if(cnt[find(a[i])]==N){
      cout<<C[i]<<'\n';
      return 0;
    }
  }
}