Given N strings, two strings are said to be connectable if number of set bits in integer representation of last char of first string are equal to first char of second string. We have to determine if it is possible to form a ring chain by using all the strings.\nInteger representation of \'A\' is 0 ,\'B\' is 1 and so on \'Z\' is 25.\n1<=N<=10^4\nExample -\nN=3\n**BBD FAC CZE**\nOutput - POSSIBLE\nRing can be formed as **BBD->FAC->CZE->BBD**\n

Given N strings, two strings are said to be connectable if number of set bits in integer representation of last char of first string are equal to first char of 