B. Obsession with Robots

The whole world got obsessed with robots,and to keep pace with the progress, great Berland's programmer Draude decided to build his own robot. He was working hard at the robot. He taught it to walk the shortest path from one point to another, to record all its movements, but like in many Draude's programs, there was a bug — the robot didn't always walk the shortest path. Fortunately, the robot recorded its own movements correctly. Now Draude wants to find out when his robot functions wrong. Heh, if Draude only remembered the map of the field, where he tested the robot, he would easily say if the robot walked in the right direction or not. But the field map was lost never to be found, that's why he asks you to find out if there exist at least one map, where the path recorded by the robot is the shortest.

The map is an infinite checkered field, where each square is either empty, or contains an obstruction. It is also known that the robot never tries to run into the obstruction. By the recorded robot's movements find out if there exist at least one such map, that it is possible to choose for the robot a starting square (the starting square should be empty) such that when the robot moves from this square its movements coincide with the recorded ones (the robot doesn't run into anything, moving along empty squares only), and the path from the starting square to the end one is the shortest.

In one movement the robot can move into the square (providing there are no obstrutions in this square) that has common sides with the square the robot is currently in.

Input

The first line of the input file contains the recording of the robot's movements. This recording is a non-empty string, consisting of uppercase Latin letters L, R, U and D, standing for movements left, right, up and down respectively. The length of the string does not exceed 100.

Output

In the first line output the only word OK (if the above described map exists), or BUG (if such a map does not exist).

Examples

input

Copy

LLUUUR

output

Copy

OK

input

Copy

RRUULLDD

output

Copy

BUG

题目描述：

从任意一个位置开始 根据UDRL作为方位指引进行上下右左移动（在纸上画一个路线）

题目问如果这条路线是从起点（你自己的起始点）到终点（最后一次移动后的位置）的路线是否是最短的（就是不要出现兜圈子的行为）

#include<iostream>
#include<cstring>
using namespace std;
int sx=200,sy=200;
int dir[4][2]={{0,1},{0,-1},{-1,0},{1,0}}; 
int vis[550][550];
string a;
int main()
{
	//1.路不重复走 即下一个到达的点不能被访问过 
	//2.走到的那个点的周围四处只有这一次的到达过 其他三处都未访问过 
	vis[sx][sx]=1;		//初始位置
	cin>>a;
	for(int i=0;i<a.length();i++)
	{
		if(a[i]=='U')
		sx--;
		else if(a[i]=='D')
		sx++;
		else if(a[i]=='L')
		sy--;
		else sy++;
		if(vis[sx][sy])		//如果我们下一个到达的点已经被走过了 直接输出bug 
		{
			cout<<"BUG";
			return 0;
		} 
		vis[sx][sy]=1;	//否则走过的下一个点标记为1 
		int count=0;
		for(int j=0;j<4;j++)
		{
			if(vis[sx+dir[j][0]][sy+dir[j][1]])		//往四个方向找路 
			count++; 
		}
		if(count!=1)
		{
			cout<<"BUG";
			return 0;
		}
	} 
	cout<<"OK";
	
}