GTSBDNY  Guess The Setters
Guess the setters  GTSBDNY
Problem solving is fun. We always try to use our algorithmic knowledge to solve some problems. Sometimes we use our intuition to solve a problem. We don’t know the proof and we don’t know whether the solution idea will really work for all kinds of cases. And sometimes, when we see that limit is low, brute force is possible to solve the problem. Most of the time it is ok, and actually it is always OK! So try brute force for this problem. :P
This problem is nothing but an old riddle about guessing the problem setters. Most of the people think that why the hell one should guess the names of the problem setters!! It’s fun actually, but not for some nerdy people I guess. By the way, in this problem you will again try to guess the problem setters. But we will give you some options to answer. You need to guess. The answer sequence is somehow related to the number 11111011110. Easy, huh? Let’s try.
ID 
Problem Code 
Problem Name 
Options 
0 
BADXOR 
BAD XOR 

1 
MAXRAD 
Maximum Radius 

2 
BUYINT 
Buying Integers 

3 
TREEPAL 
Tree and Palindrome 

4 
SPACEBRG 
Space Bridges 

5 
XYI 
XYI 

6 
MNIU 
My Name is UMM! 

Input
There is no input for this problem
Output
You should output the answer sequence with these digits only ‘0’, ‘1’,’2’. And you should give output a string with exactly 7 digits. Example: 1110211. The Most significant digit (the leftmost one) of the output string will correspond to the problem BADXOR and the least significant digit (the right most one) will correspond to the problem MNIU
Added by:  Faiyaz 
Date:  20131223 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 