#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int N=1000+10;
int n,siz;
int mp[6][6];
int a[6][6];
bool vis[6];//注意这个vis
bool flag=true;
struct node{int x,y,v;char f;
}q[N];
int main()
{scanf("%d",&n);for(int i=1;i<=n;i++) scanf("%d%d%d %c",&q[i].x,&q[i].y,&q[i].v,&q[i].f);for(int i=1;i<=n;i++){siz++;if(siz>16) {flag=false;break;}//warningmp[q[i].x][q[i].y]=q[i].v;memset(a,0,sizeof a);if(q[i].f=='U'){for(int j=1;j<=4;j++){memset(vis,0,sizeof vis);int k=1;for(int i=1;i<=4;i++){if(mp[i][j]) {    a[k][j]=mp[i][j];if(k>1&&a[k-1][j]==a[k][j]&&!vis[k-1]) a[k-1][j]=2*a[k-1][j],vis[k-1]=1,a[k][j]=0,k--;k++;}}}}else if(q[i].f=='D'){for(int j=1;j<=4;j++){memset(vis,0,sizeof vis);int k=4;for(int i=4;i>=1;i--){if(mp[i][j]) {    a[k][j]=mp[i][j];if(k<4&&a[k+1][j]==a[k][j]&&!vis[k+1]) a[k+1][j]=2*a[k+1][j],vis[k+1]=1,a[k][j]=0,k++;k--;}}}}else if(q[i].f=='L'){for(int i=1;i<=4;i++){memset(vis,0,sizeof vis);int k=1;for(int j=1;j<=4;j++){if(mp[i][j]) {    a[i][k]=mp[i][j];if(k>1&&a[i][k-1]==a[i][k]&&!vis[k-1]) a[i][k-1]=2*a[i][k-1],vis[k-1]=1,a[i][k]=0,k--;k++;}}}}else{for(int i=1;i<=4;i++){memset(vis,0,sizeof vis);int k=4;for(int j=4;j>=1;j--){if(mp[i][j]) {    a[i][k]=mp[i][j];if(k<4&&a[i][k+1]==a[i][k]&&!vis[k+1]) a[i][k+1]=2*a[i][k+1],vis[k+1]=1,a[i][k]=0,k++;k--;}}}}memcpy(mp,a,sizeof a);siz=0;for(int i=1;i<=4;i++)for(int j=1;j<=4;j++)if(mp[i][j]) siz++;}if(!flag){printf("Game over!");}else{for(int i=1;i<=4;i++){for(int j=1;j<=4;j++){if(j!=4) printf("%d ",mp[i][j]);else printf("%d",mp[i][j]);}puts("");}}return 0;
}

#include<bits/stdc++.h>
using namespace std;
int t,a,b,c;
bool er(int x)
{if(a<x||b<x) return false;int la=min((int)ceil(1.0*x/2),a-x),lb=min((int)ceil(1.0*x/2),b-x),lc=min(c,(int)ceil(1.0*x/2));if(la+lb+lc<x) return false;if(la+lb+1<lc||lb+lc+1<la||lc+la+1<lb) return false;return true;
}
int ans,l,r;
int main()
{cin>>t;while(t--){scanf("%d%d%d",&a,&b,&c);r=a+b+c;l=0;ans=0;while(l<=r){int mid=(l+r)/2;    if(er(mid)) ans=max(ans,mid),l=mid+1;else r=mid-1;}printf("%d\n",ans);}return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int N=1e7+10;
const int inf=0x3f3f3f3f;
int n,x;
int p[N],f[N];
int a[N];
inline int gen(int x){return (1LL*x*(x^(x>>1))+(x-3)*(x|(x<<1)))%min(n,5000)+1;
}
int main(){scanf("%d%d",&n,&x);for(int i=1;i<=n;++i)x=gen(x),a[i]=x;memset(p,inf,sizeof p);p[1]=1+a[1];for(int i=2;i<=n;i++){f[i]=lower_bound(p+1,p+n+1,i)-p;if(p[f[i]+1]!=inf) p[f[i]+1]=max(p[f[i]+1],i+a[i]);else p[f[i]+1]=i+a[i];}printf("%d",f[n]);return 0;
}