#include<bits/stdc++.h>
using namespace std;
struct tree{
int fa,color;
vector<int>son;
}x[100001];
vector<int>path;
int n,u,v,ans1=0,ans2=0;
void dfs(int t,int color){
if(x[t].color)return;
x[t].color=color;
for(int i:x[t].son)dfs(i,color);
}int main(){
cin>>n;
x[1].color=1;
x[n].color=-1;
for(int i=2;i<n;i++)x[i].color=0;
for(int i=1;i<n;i++){
cin>>u>>v;
if(u>v)swap(u,v);
x[u].son.push_back(v);
x[v].fa=u;
}for(int i=x[n].fa;i>1;i=x[i].fa)path.push_back(i);
while(!path.empty()){
x[path.back()].color=1;
path.pop_back();
if(path.empty())break;
x[path[0]].color=-1;
path.erase(path.begin());
}dfs(1,1);
dfs(n,-1);
for(int i=1;i<=n;i++){
if(x[i].color==1)ans1++;
else ans2++;
}if(ans1>ans2)cout<<"Red";
else cout<<"Blue";
return 0;
}
目前WA64分，一直输出Blue