Takahashi has decided to make a Christmas Tree for the Christmas party in AtCoder, Inc.

A Christmas Tree is a tree with N vertices numbered 1 through N and N-1 edges, whose i-th edge (1\leq i\leq N-1) connects Vertex a_i and b_i.

He would like to make one as follows:

* Specify two non-negative integers A and B.
* Prepare A Christmas Paths whose lengths are at most B. Here, a Christmas Path of length X is a graph with X+1 vertices and X edges such that, if we properly number the vertices 1 through X+1, the i-th edge (1\leq i\leq X) will connect Vertex i and i+1.
* Repeat the following operation until he has one connected tree:
* Select two vertices x and y that belong to different connected components. Combine x and y into one vertex. More precisely, for each edge (p,y) incident to the vertex y, add the edge (p,x). Then, delete the vertex y and all the edges incident to y.
* Properly number the vertices in the tree.



Takahashi would like to find the lexicographically smallest pair (A,B) such that he can make a Christmas Tree, that is, find the smallest A, and find the smallest B under the condition that A is minimized.

Solve this problem for him.

Constraints

* 2 \leq N \leq 10^5
* 1 \leq a_i,b_i \leq N
* The given graph is a tree.

Input

Input is given from Standard Input in the following format:


N
a_1 b_1
:
a_{N-1} b_{N-1}


Output

For the lexicographically smallest (A,B), print A and B with a space in between.

Examples

Input

7
1 2
2 3
2 4
4 5
4 6
6 7


Output

3 2


Input

8
1 2
2 3
3 4
4 5
5 6
5 7
5 8


Output

2 5


Input

10
1 2
2 3
3 4
2 5
6 5
6 7
7 8
5 9
10 5


Output

3 4
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

#define mp make_pair
#define pb push_back
#define ll long long

#define maxN 100011

int n, i, x, y, cnt, limit;
vector<int> list[maxN];
int dp[maxN];
bool bad;
vector<int> aux;

bool good(int deny) {
    int p1, p2;

    p1 = 0; p2 = aux.size() - 1;
    while (p1 < p2) {
        if (deny == p1) {
            p1++; continue;
        }
        if (deny == p2) {
            p2--; continue;
        }

        if (aux[p1] + aux[p2] > limit) return false;
        p1++; p2--;
    }

    return true;
}

void dfs(int node, int root) {
    for (auto to : list[node])
        if (to != root && bad == false)
            dfs(to, node);

    if (bad) return;

    aux.clear();

    for (auto to : list[node])
        if (to != root)
            aux.pb(dp[to] + 1);

    if (node != 1 && aux.size() % 2 == 0) aux.pb(0), cnt++;
    sort(aux.begin(), aux.end());
    cnt -= aux.size() / 2;

    if (aux.size() % 2 == 0) {
        if (!good(-1)) bad = true;
        return;
    }

    int ans = -1;
    for (int step = 1 << 20; step > 0; step >>= 1)
        if (ans + step < aux.size())
            if (!good(ans + step))
                ans += step;

    ans++;
    if (ans == aux.size()) {
        bad = true;
        return;
    }

    dp[node] = aux[ans];
    if (dp[node] > limit) bad = true;
}

bool check(int _limit) {
    cnt = 0;
    limit = _limit;
    bad = false;
    dfs(1, 0);
    if (bad) return false;
    return true;
}

int main()
{
    //freopen("test.in","r",stdin);

    cin >> n;
    for (i = 1; i < n; i++) {
        cin >> x >> y;
        list[x].pb(y);
        list[y].pb(x);
    }

    int ans = 0;
    for (int step = 1 << 20; step > 0; step >>= 1)
        if (ans + step < n)
            if (!check(ans + step))
                ans += step;

    //cerr << check(1);

    check(ans + 1);
    cout << cnt << ' ' << ans + 1;


    return 0;
}
