#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
const int INF = 1e9 + 7;
const int N = 6e5 + 5;
const long double EPS = 1e-12;
const int MOD = 998244353;
const int ALP = 26;
int trie[N][26], cur, com[N], n;
int merge(int a, int b) {
  if (!a || !b) return a + b;
  cur++;
  int tmp = cur;
  for (int i = 0; i < ALP; i++) {
    trie[tmp][i] = merge(trie[a][i], trie[b][i]);
  }
  return tmp;
}
void dfs(int v, int h) {
  int first;
  cur = first = n + 1;
  for (int i = 0; i < ALP; i++) {
    first = merge(first, trie[v][i]);
  }
  com[h] += cur - n - 1;
  for (int i = 0; i < ALP; i++) {
    if (trie[v][i]) {
      dfs(trie[v][i], h + 1);
    }
  }
}
void solve() {
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    char c;
    cin >> u >> v >> c;
    trie[u][c - 'a'] = v;
  }
  dfs(1, 1);
  pair<int, int> res = {INF, INF};
  for (int i = 1; i <= n; i++) {
    res = min(res, {n - com[i], i});
  }
  cout << res.first << ' ' << res.second;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int tests = 1;
  while (tests-- > 0) {
    solve();
  }
  return 0;
}
