For this Question: Bob has a string S consisting of lowercase English letters. He defines S′ to be the string after removing all "a" characters from S (keeping all other characters in the same order). He then generates a new string T by concatenating S and S′. In other words, T=S+S′.

You are given a string T. Your task is to find some S that Bob could have used to generate T. It can be shown that if an answer exists, it will be unique.The first line contains a single string S.

Constraints:
1<=|S|<=100000Print a string S that could have generated T. It can be shown if an answer exists, it is unique. If no string exists, print ":(" (without double quotes, there is no space between the characters).Sample Input 1:
ababacacbbcc

Sample Output 1:
ababacac

Explanations:
we have s= "ababacac", and s′= "bbcc", and t=s+s′= "ababacacbbcc"., I have written this Solution Code: inp = input()
inp1 = inp.replace('a','')
l = len(inp1)//2
ind = len(inp)-l
if(inp[0:ind]+inp1[l:] == inp ):
    print(inp[0:ind])
else:
    print(":("), In this Programming Language: Python, Now tell me if this Code is compilable or not?