Problem Statement

Veena is a young and beautiful girl (a rare BIT species) who decides to get married.So she organizes a 'Swamvar' to select the groom. The final round of the 'Swamvar' is a test of speed.Veena has placed herself in one of the rooms of the main building.Since it is the last round not more than 5 contestants have made it (1-5) and each of them have been assigned an English alphabet [A-E] as their chest no.They have also been placed in different rooms of the main building
To be more specific let's consider the main building as a N x N 2D grid. In the grid there are some symbols, the meaning of them are:

 '.' an empty space # an obstacle [A-E] an English alphabet representing the initial location of contestants V Location of Veena

Each room has four doors in North South East and West direction.A contestant can move from his present room to any of the four adjacent rooms that are empty or occupied by another contestant consuming 1 unit of time in each step.A contestant can never enter a room containing an obstacle.Veena will marry the man who reaches her in the least time.You are suppose to print the winning contestant's chest no followed by a space and then the time taken by the winner to reach Veena.If two contestants reach simultaneously you need to print "Only the VC can decide now" (quotes for clarity). If none of them are able to reach Veena print "Single Forever!" (quotes for clarity)Lets see who the lucky guy is :P.

Input

• There can be multiple test cases
• Each test case will contain an integer N (N<=20) which represents the dimension of the main building (NxN).
• Next 'N' lines will contain the description of the main building.

Output

• For each test case you have to print the chest no of the winning contestant and the time he took to reach Veena Separated by space
• If two contestants take the same time you need to print "Only the VC can decide now"
• If none of them are able to reach Veena print "Single Forever!"
• There should be a newline after each answer.

Sample Input

``` 20 .........A.......... ####..####..#.....#. #..#..#.....#.#.#.#. ####..#.....#..#..#. #..#..#.....#.....#. #..#..####..#.....#. .................... .................... .................... C........V........B. ..##........##...D## .................... ####.####.#..#.####. .#...#..#.#..#.#..#. .#...####.####.####. .#...#..#.#..#.#..#. .#...#..#.#..#.#..#. .................... #########........... .........E#########. 5 A..BC ..#.. #.V.. ##.#. ##D.. 4 ...A #### B### #V.. ```

Sample Output

``` Only the VC can decide now D 2 Single Forever! ```

Problem Setter: Md Taha Bin Jawaid (TBJ)

Languages: C,C++,Java

Time Limit: 1 Second(s)
Score: 100 Point(s)
Input File Limit: 50000 Bytes

Mode Judge

RankNameScore
1xyz0
2Ams0
3TIP0
4team420
5xyzz0
6asdasdasd0
7abcd0
8khankhan0
9Gabriel0
10gigel0