1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <algorithm>
 5 using namespace std;
 6 #define int long long
 7 #define N 200005
 8 #define root 1
 9 int read() {
10     int s=0,f=1;
11     char ch=getchar();
12     for( ; ch<'0'||ch>'9'; f=(ch=='-')?-1:f,ch=getchar()) ;
13     for( ; ch>='0'&&ch<='9'; s=s*10+(ch^48),ch=getchar()) ;
14     return s*f;
15 }
16 int n,tot,r[N],Fa[N],low,high,Dis,deep[N],dis[N],Ans2;
17 struct oo {int fr,to,next,vv;} c[N<<1|1];
18 bool vis[N],Up[N],Down[N];
19 void add(int x,int y,int z) {
20     c[++tot].fr=x;
21     c[tot].to=y;
22     c[tot].vv=z;
23     c[tot].next=r[x];
24     r[x]=tot;
25 }
26 void dfs1(int u,int f,int d) {
27     if(d>Dis) Dis=d,low=u;
28     for(int i=r[u]; ~i; i=c[i].next) if(c[i].to!=f) dfs1(c[i].to,u,d+c[i].vv);
29 }
30 void dfs2(int u,int f) {
31     if(deep[u]>Dis) Dis=deep[u],high=u;
32     for(int i=r[u]; ~i; i=c[i].next) {
33         if(c[i].to!=f) {
34             Fa[c[i].to]=u,dis[c[i].to]=dis[u]+1;
35             deep[c[i].to]=deep[u]+c[i].vv;
36             dfs2(c[i].to,u);
37         }
38     }
39 }
40 void dfs(int u,int f,int d,int &mx) {
41     mx=max(mx,d);
42     for(int i=r[u]; ~i; i=c[i].next) if(c[i].to!=f&&!vis[c[i].to]) dfs(c[i].to,u,d+c[i].vv,mx);
43 }
44 signed main() {
45     n=read();
46     memset(r,0xff,sizeof(r));
47     for(int x,y,z,i=1; i<n; ++i) {
48         x=read(),y=read(),z=read();
49         add(x,y,z),add(y,x,z);
50     } dfs1(root,root,0); Dis=0; dfs2(low,low);
51     for(int i=high; i!=low; i=Fa[i]) vis[i]=true;
52     vis[low]=true;
53     for(int i=high,mx=0; ; i=Fa[i],mx=0) {
54         dfs(i,i,0,mx);
55         if(mx==deep[i]) Up[i]=true;
56         if(mx==Dis-deep[i]) Down[i]=true;
57         if(i==low) break;
58     } int pos1=0,pos2=0;
59     for(int i=high; ; i=Fa[i]) {
60         if(Up[i]&&!pos1) pos1=i;
61         if(Down[i]) pos2=i;
62         if(i==low) break;
63     } Ans2=dis[pos2]-dis[pos1];
64     if(Ans2<0) Ans2=0;
65     printf("%lld\n%lld",Dis,Ans2);
66     return 0;
67 }