#include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define all(a) a.begin(),a.end()
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > > 
#define pii pair<int,int> 
#define pb push_back
#define mp make_pair
#define debuge cerr<<"isok"<<endl
#define debug(x) cerr<<#x<<"="<<x<<endl
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
#define SS second
#define FF first
#define ls (k<<1)
#define rs (k<<1|1)
#define clr(a,x) memset(a,x,sizeof(a))
#define cpy(a,x) memcpy(a,x,sizeof(a))
#define file(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define SZ(x) ((int)x.size())
using namespace std;
template<class T> inline void gmin(T &x,const T &y){x=x>y?y:x;}
template<class T> inline void gmax(T &x,const T &y){x=x<y?y:x;}
template<class T> inline bool Gmin(T &x,const T &y){return x>y?x=y,1:0;}
template<class T> inline bool Gmax(T &x,const T &y){return x<y?x=y,1:0;}
const int BufferSize=1<<16;
char buffer[BufferSize],*Bufferhead,*Buffertail;
bool Terminal;
inline char Getchar(){
	if(Bufferhead==Buffertail){
		int l=fread(buffer,1,BufferSize,stdin);
		if(!l){Terminal=1;return 0;}
		Buffertail=(Bufferhead=buffer)+l;
	}
	return *Bufferhead++;
}
template<class T>inline bool read(T &x){
	x=0;char c=Getchar(),rev=0;
	while(c<'0'||c>'9'){rev|=c=='-';c=Getchar();if(Terminal)return 0;}
	while(c>='0'&&c<='9') x=x*10+c-'0',c=Getchar();
	if(c=='.'){
		c=Getchar();double t=0.1;
		while(c>='0'&&c<='9') x=x+(c-'0')*t,c=Getchar(),t=t/10;
	}
	x=rev?-x:x;
	return 1;
}
template<class T1,class T2> inline bool read(T1 &x,T2 &y){return read(x)&read(y);}
template<class T1,class T2,class T3> inline bool read(T1 &x,T2 &y,T3 &z){return read(x)&read(y)&read(z);}
template<class T1,class T2,class T3,class T4> inline bool read(T1 &x,T2 &y,T3 &z,T4 &w){return read(x)&read(y)&read(z)&read(w);}
inline bool reads(char *x){
	char c=Getchar();
	while(c<33||c>126){c=Getchar();if(Terminal)return 0;}
	while(c>=33&&c<=126) (*x++)=c,c=Getchar();
	*x=0;return 1;
}
template<class T>inline void print(T x,const char c='\n'){
	if(!x){putchar('0');putchar(c);return;}
	if(x<0) putchar('-'),x=-x;
	int m=0,a[20];
	while(x) a[m++]=x%10,x/=10;
	while(m--) putchar(a[m]+'0');
	putchar(c);
}
//--------------------------------head---------------------------------------------

const int inf=0x3f3f3f3f;
const int N=100005,M=100005,mod=1e9+7;
template<class T,class S> inline void ch(T &x,const S y){x=(x+y)%mod;}
inline int exp(int x,int y,const int mod=::mod){
	int ans=1;
	while(y){
		if(y&1) ans=(ll)ans*x%mod;
		x=(ll)x*x%mod;y>>=1;
	}return ans;
}

int n,m,res,A,B,du[N],dp[N],a[N],pre[N],nex[N];
bool vis[N];
vi g[N];

inline void rem(int x){
	vis[x]=1;
	int l=pre[x],r=nex[x];
	if(r) pre[r]=l;nex[l]=r;
}
inline int solve(int n){
	int tag=0;
	for(int i=0;i<n;i++)
		nex[i]=i+1,pre[i+1]=i;
	nex[n]=pre[0]=0;
	for(int i=0;i<=n;i++) vis[i]=0;
	for(int i=n;i;i--){
		if(vis[i]) continue;
		while(nex[tag]&&a[nex[tag]]+a[i]+1<=B) tag=nex[tag];
		if(tag==i) tag=pre[tag];
		if(!tag) return a[i];
		rem(i);rem(tag);
		tag=pre[tag];
	}
}

inline void dfs(int x,int F=0){
	bool isok=0;
	for(int y:g[x]){
		if(y==F) continue;
		dfs(y,x);isok=1;
	}
	if(!isok){dp[x]=1;return;}
	m=0;
	for(int y:g[x])
		if(y!=F) a[++m]=dp[y];
	sort(a+1,a+m+1);
	int ret=0;
	for(int l=1,r=m;l<r;r--)
		if(a[l]+a[r]+1<=B) l++,ret++;
	if(ret*2==m){res+=ret;dp[x]=1;return;}
	res+=m-ret-1;
	int p=solve(ret*2+1);
	if(p+1==B) res++,dp[x]=1; else dp[x]=p+1;
}

int main(){
#ifdef rqgao2014
	assert(freopen("08.txt","r",stdin));
#endif
	read(n);
	for(int i=1;i<n;i++){
		int x,y;read(x,y);
		g[x].pb(y);g[y].pb(x);
		du[x]++;du[y]++;
	}
	A++;
	for(int i=1;i<=n;i++)
		A+=(du[i]-1)/2;
	int l=2,r=n;
	while(l<r){
		int mid=l+r>>1;B=mid;
		res=0;dfs(1);if(dp[1]!=1) res++;
		if(res<=A) r=mid; else l=mid+1;
	}
	printf("%d %d\n",A,r-1);
	return 0;
}

Measured memory_bytes: 12672