#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define MAXN 10010
using namespace std;
int n,tot;
int dis[MAXN],vis[MAXN];
int to[MAXN*2],net[MAXN*2],cap[MAXN*2],head[MAXN];
int judge(char x){
    if(x>=‘A‘&&x<=‘Z‘)    return x-‘A‘+1;
    if(x>=‘a‘&&x<=‘z‘)    return x-‘a‘+1+26;
}
void add(int u,int v,int w){
    to[++tot]=v;net[tot]=head[u];cap[tot]=w;head[u]=tot;
    to[++tot]=u;net[tot]=head[v];cap[tot]=w;head[v]=tot;
}
void spfa(int s){
    queue<int>que;
    memset(vis,0,sizeof(vis));
    memset(dis,0x3f,sizeof(dis));
    que.push(s);dis[s]=0;vis[s]=1;
    while(!que.empty()){
        int now=que.front();
        que.pop();vis[now]=0;
        for(int i=head[now];i;i=net[i])
            if(dis[to[i]]>dis[now]+cap[i]){
                dis[to[i]]=dis[now]+cap[i];
                if(!vis[to[i]]){
                    vis[to[i]]=1;
                    que.push(to[i]);
                }
            }
    }
}
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        char a,b;int c;
        scanf("\n%c %c %d",&a,&b,&c);
        int x=judge(a);int y=judge(b);
        add(x,y,c);
    }
    spfa(26);int minn=0x7f7f7f7f,ans;
    for(int i=1;i<=25;i++)
        if(dis[i]<minn){
            minn=dis[i];
            ans=i;
        }
    cout<<char(ans-1+‘A‘)<<" "<<minn; 
}