[Sdoi2013]直径（树的直径）

//36分

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;

#define setfire(name) freopen(#name".in","r",stdin);freopen(#name".out","w",stdout);
#define fre(name) freopen(#name".txt","r",stdin);
#ifdef WIN32
#define LL "%lld"
#else
#define LL "%I64d"
#endif

const int N=2e5+;
const int Z=;
int n,S1,S2,la,lb,s_cnt,b[N],stack[N],prev[N];char s[];bool vis[N];
struct edge{int u,v,next;ll w;}e[N<<];int tot=,head[N];
int dep[N],fa[N][];
ll ans,LEN,dis[N],dist[N];
bool mark[Z][Z];
struct data{int x,y;}state[N];
inline int read(){
    int x=;char ch=getchar();
    while(ch<''||ch>''){ch=getchar();}
    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
    return x;
}
inline void add(int x,int y,int z){
    e[++tot].u=x;e[tot].v=y;e[tot].w=z;e[tot].next=head[x];head[x]=tot;
    e[++tot].u=y;e[tot].v=x;e[tot].w=z;e[tot].next=head[y];head[y]=tot;
}
void BFS(int S){
    int top=;
    stack[top]=S;dep[S]=;fa[S][]=S;
    while(top){
        int x=stack[top--];
        for(int i=head[x];i;i=e[i].next){
            if(e[i].v!=fa[x][]){
                fa[e[i].v][]=x;
                dep[e[i].v]=dep[x]+;
                dist[e[i].v]=dist[x]+e[i].w;
                stack[++top]=e[i].v;
            }
        }
    }
}
inline int bfs(int S){
    memset(dis,-,sizeof dis);
    memset(vis,,sizeof vis);
    int id=,mx=-,top=;
    stack[top]=S;dis[S]=;vis[S]=;
    while(top){
        int x=stack[top--];
        for(int i=head[x];i;i=e[i].next){
            if(!vis[e[i].v]&&dis[e[i].v]<dis[x]+e[i].w){
                vis[e[i].v]=;
                dis[e[i].v]=dis[x]+e[i].w;
                if(dis[e[i].v]>mx) mx=dis[e[i].v],id=e[i].v;
                stack[++top]=e[i].v;
            }
        }
    }
    return id;
}
void gosolve(int S,int T){
    memset(vis,,sizeof vis);
    int id=,mx=-,top=;
    stack[top]=S;vis[S]=;
    while(top){
        int x=stack[top--];
        for(int i=head[x];i;i=e[i].next){
            if(!vis[e[i].v]){
                vis[e[i].v]=;
                prev[e[i].v]=i;
                if(e[i].v==T){top=;break;}
                stack[++top]=e[i].v;
            }
        }
    }
    for(int i=T;i!=S;i=e[prev[i]^].v)  b[prev[i]>>]++;
}
int lca(int a,int b){
    if(dep[a]<dep[b]) swap(a,b);
    int t=dep[a]-dep[b];
    for(int i=;i<=;i++){
        if(t&(<<i)){
            a=fa[a][i];
        }
    }
    if(a==b) return a;
    for(int i=;i>=;i--){
        if(fa[a][i]!=fa[b][i]){
            a=fa[a][i];
            b=fa[b][i];
        }
    }
    return fa[a][];
}
void init(){
    n=read();
    for(int i=,x,y,z;i<n;i++) x=read(),y=read(),z=read(),add(x,y,z);
}
void dp_tree_len(int x,int fa){
    for(int i=head[x],y;i;i=e[i].next){
        if((y=e[i].v)!=fa){
            if((x==la&&y==lb)||(x==lb&&y==la)) continue;
            dp_tree_len(y,x);
            LEN=max(LEN,dis[x]+dis[y]+e[i].w);
            dis[x]=max(dis[x],dis[y]+e[i].w);
        }
    }
}
void work(){
    if(n<=){
        BFS();
        for(int i=,mx=;i<=n;i++) if(dist[i]>mx) mx=dist[i],S1=i;
        S2=bfs(S1);
        LEN=dis[S2];
        printf("%I64d\n",LEN);
        for(int j=;j<=;j++){
            for(int i=;i<=n;i++){
                fa[i][j]=fa[fa[i][j-]][j-];
            }
        }
        ll lt;
        for(int i=,anc;i<=n;i++){
            for(int j=;j<i;j++){
                if(mark[i][j]) continue;
                anc=lca(i,j);
                lt=dist[i]+dist[j]-dist[anc]*;
                if(lt==LEN) mark[i][j]=,state[++s_cnt]=(data){i,j};
            }
        }
        //直径条数
        for(int i=;i<=s_cnt;i++){
            gosolve(state[i].x,state[i].y);
        }
        int num=;
        for(int i=;i<=n;i++) if(b[i]==s_cnt) num++;
        printf("%d",num);
    }
    else{
        dp_tree_len(,);
        printf("%I64d\n",LEN);
    }
}
int main(){
    freopen("diameter.in","r",stdin);
    freopen("diameter.out","w",stdout);
    int size=<<;
    char *p=(char*)malloc(size)+size;
    __asm__("movl %0,%%esp\n"::"r"(p));
    init();
    work();
    return ;
}