$Riggi$   is a spy of $KBI$ and he is on a secret mission, he is spying an Underworld Don  $Anit$.
$Riggi$  is spying him since 5 years and he is not able to find  any evidence against $Anit$. 
$KBI$ told $Riggi$ they will send him a code string in a special format that will inform him whether he  has continue or return back from mission.
According to $KBI$  firstly  he  has to find what is the original string and then he has to check string is palindrome or not .
If its a palindrome then he has to leave the mission and return back else continue spying $Anit$. 
Rules to find original string :
1:-If in Code string any integer(N) followed by a string of alphabets that starts with '+' and  ends with '-' then he has to repeat that string N times  , like 3+acg- = acgacgacg.
2:-If there is no integer present before string then print the string is repeated 1 time.
like bc=bc.
Example of conversion from  Code string  to original string  : 2+ac-3+kb-j=acackbkbkbj  

-----Input:-----
- Code string $S$ is taken as input  .

-----Output:-----
- Print  string $Continue$ if code string $S$ is not a palindrome else print $Return$ .

-----Constraints-----
- $1 \leq S \leq 1000$
- $1 \leq N \leq 1000$

-----Sample Input 1:-----
3+xy-bb3+yx-

-----Sample Output 1:-----
Return

-----Sample Input 2:-----
3+xy-bb3+xy-

-----Sample Output 2:-----
Continue

-----EXPLANATION:-----
Sample 1:- original string will be xyxyxybbyxyxyx which is  a palindrome hence print $Return$.
Sample 2:- original string will be xyxyxybbxyxyxy which is not a palindrome hence print 
$Continue$.

Difficulty: interview

Starter code:

Solutions:
# cook your dish here
s=input()
i=0 
l=len(s)
orig=''
st=[]
flag=False
while(i<l):
    if(s[i].isdigit()):
        num=int(s[i])
        
    elif(s[i].isalpha()):
        if(flag==False):
            orig+=s[i]
        else:st.append(s[i]) 
    elif(s[i]=='+'):
        flag=True
        st.clear()
    
    elif(s[i]=='-'):
        orig+=("".join(st))*num 
        flag=False
        
    i+=1
if(orig==orig[::-1]):
    print("Return")
else:
    print("Continue")

# cook your dish here
s=input()
i=0 
l=len(s)
orig=''
st=[]
flag=False
while(i<l):
    if(s[i].isdigit()):
        num=int(s[i])
        
    elif(s[i].isalpha()):
        if(flag==False):
            orig+=s[i]
        else:st.append(s[i]) 
    elif(s[i]=='+'):
        flag=True
        st.clear()
    
    elif(s[i]=='-'):
        orig+=("".join(st))*num 
        flag=False
        
    i+=1
if(orig==orig[::-1]):
    print("Return")
else:
    print("Continue")

# cook your dish here
x=[chr(i) for i in range(48,57)]
y=input()
c=''
s=''
i=0
p=0
while i<len(y):
    if y[i] in x:
        p=int(y[i])
        i=i+1
        if y[i]=='+':
            i+=1
            while y[i]!='-':
                c=c+y[i]
                i=i+1
        i+=1
        s=s+c*p
        c=''
        #print(s)
    else:
        s=s+y[i]
        #print(s)
        i=i+1
if s==s[::-1]:
    print("Return")
else:
    print("Continue")

a=list(input())
pre=[];i=0;ans=''
while i<len(a):
    if ord(a[i])>=48 and ord(a[i])<58 and i<len(a) and '-' in a[i:] and a[i+1]=='+':
        b=a[i+1:]
        p1=b.index('-')
        ans+=''.join(a[i+2:p1+i+1])*int(a[i])
        i=i+p1+1
    elif a[i]!='+' and a[i]!='-' and not (ord(a[i])>=48 and ord(a[i])<58):
        ans+=a[i]
    i+=1
print("Continue" if ans!=ans[::-1] else "Return")

a=list(input())
pre=[]
i=0
ans=''
c=0
while i<len(a):
    if ord(a[i])>=48 and ord(a[i])<58 and i<len(a) and '-' in a[i:] and a[i+1]=='+':
        b=a[i+1:]
        p1=b.index('-')
        ans+=''.join(a[i+2:p1+i+1])*int(a[i])
        i=i+p1+1
    # elif ord(a[i])>=48 and ord(a[i])<58:
    #     ans+=a[i]
    elif a[i]!='+' and a[i]!='-' and not (ord(a[i])>=48 and ord(a[i])<58):
        ans+=a[i]
    i+=1
print("Continue" if ans!=ans[::-1] else "Return")

# cook your dish here
s = input().strip()
s = s.replace('-', '+')
s = list(s.split('+'))
w = []
for i in range(len(s)):
    f = 0
    for j in range(1,len(s[i])):
        if not s[i][j].isalpha():
            w.append(s[i][:j])
            w.append(s[i][j:])
            f = 1
            break
    if not f:
        w.append(s[i])
#print(s, w)
res = ''
m = 1
for i in range(len(w)):
    if not w[i].isalpha():
        if w[i] != '':
            m = int(w[i])
    else:
        res += m*w[i]
        m = 1
if res == res[::-1]:
    print('Return')
else:
    print('Continue')


# cook your dish here
s=input()
st=""
st2=""
for i in range(len(s)):
    if s[i].isdigit():
        st2=st2+st
        st=""
        n=int(s[i])
        continue
    elif s[i]=='+':continue
    elif s[i]=='-':
        st=st*n
    else:
        st=st+s[i]
        
if st!="":st2=st2+st
if st2[::-1]==st2:
    print("Return")
else:print("Continue")

import sys
import math
import bisect
from sys import stdin,stdout
from math import gcd,floor,sqrt,log
from collections import defaultdict as dd
from bisect import bisect_left as bl,bisect_right as br

sys.setrecursionlimit(100000000)

ii     =lambda: int(input())
si     =lambda: input()
jn     =lambda x,l: x.join(map(str,l))
sl     =lambda: list(map(str,input().strip()))
mi     =lambda: list(map(int,input().split()))
mif    =lambda: list(map(float,input().split()))
lii    =lambda: list(map(int,input().split()))

ceil   =lambda x: int(x) if(x==int(x)) else int(x)+1
ceildiv=lambda x,d: x//d if(x%d==0) else x//d+1

flush  =lambda: stdout.flush()
stdstr =lambda: stdin.readline()
stdint =lambda: int(stdin.readline())
stdpr  =lambda x: stdout.write(str(x))

mod=1000000007


#main code
s=si()
p=0
n=0

sol=''
temp=''
for char in s:
    if char.isdigit():
        p=1
        d=int(char)
    elif p==1:
        if char=='+':
            continue
        elif char=='-':
            sol+=(temp*d)
            n=1
            temp=''
            p=0
        else:
            temp+=char
a=sol[::-1]
if a==sol:
    print('Return')
else:
    print('Continue')

    
            
            


s = input()
ss=[]
i=0
while i<len(s):
    if s[i].isdigit()==True:
        i+=1
    elif s[i]=='+' and s[i-1].isdigit()==True and i!=0:
        for j in range(i+1, len(s)):
            if s[j]=='-':
                break
        ss.append(int(s[i-1])*s[i+1:j])
        i=j+1
    elif s[i]=='+' and s[i-1].isdigit()==False and i!=0:
        for j in range(i+1, len(s)):
            if s[j]=='-':
                break
        ss.append(s[i+1:j])
        i=j+1
    elif s[i]=='+' and i==1:
        for j in range(i+1, len(s)):
            if s[j]=='-':
                break
        ss.append(s[i+1:j])
        i=j+1
    else:
        ss.append(s[i])
        i+=1
ss=''.join(ss)
if ss == ss[::-1]:
    print('Return')
else:
    print('Continue')

s = str(input());f = "";g = "";final = ""
for i in range(len(s)):
	f += s[i]
	if s[i] == '-':f += " "
for i in range(len(f)):
	if f[i].isdigit():g += " "
	g += f[i]
e = g.split()
for i in range(len(e)):z = e[i];final = (final + int(z[0])*(z[2:len(z)-1]) if z[0].isdigit() else final + z)
print("Return") if final == final[::-1] else print("Continue")

s = str(input())
f = ""
for i in range(len(s)):
	f += s[i]
	if s[i] == '-':f += " "
g = ""
for i in range(len(f)):
	if f[i].isdigit():g += " "
	g += f[i]
final = ""
e = g.split()
for i in range(len(e)):z = e[i];final = (final + int(z[0])*(z[2:len(z)-1]) if z[0].isdigit() else final + z)
print("Return") if final == final[::-1] else print("Continue")

s = str(input())
f = ""
for i in range(len(s)):
	f += s[i]
	if s[i] == '-':
		f += " "
g = ""
for i in range(len(f)):
	if f[i].isdigit():
		g += " "
	g += f[i]
final = ""
e = g.split()
for i in range(len(e)):
	z = e[i]
	if z[0].isdigit():
		val = z[2:len(z)-1]
		final += int(z[0])*val
	else:
		final += z
if final == final[::-1]:
	print("Return")
else:
	print("Continue")

s = str(input())
#print(len(s))
f = ""
for i in range(len(s)):
	f += s[i]
	if s[i] == '-':
		f += " "
#print(f)
#print(len(f))
g = ""
for i in range(len(f)):
	if f[i].isdigit():
		g += " "
	g += f[i]
#print(g)
#print(len(g))
#print(g.split())
final = ""
e = g.split()
for i in range(len(e)):
	z = e[i]
	#print(z)
	if z[0].isdigit():
		val = z[2:len(z)-1]
		#print(z[2:len(z)-1])
		final += int(z[0])*val
	else:
		final += z
#print(final)
if final == final[::-1]:
	print("Return")
else:
	print("Continue")

# cook your dish here
s=input().rstrip()
i=0
final=''
while i<len(s):
    if s[i].isdigit():
        val=int(s[i])
        s1=''
        while s[i]!='-':
            if s[i].isalpha():
                s1+=s[i]
            i+=1
        i+=1
        final+=s1*val
    else:
        s1=''
        while s[i].isalpha():
            s1+=s[i]
            i+=1
            if i>=len(s):
                break
        final+=s1
#print(final)
final=list(final)
temp=final[::-1]
#print(temp,final)
if final==temp:
    print('Return')
else:
    print('Continue')

s = input()
new_s = ''
for i in s:
    if i.isalpha():
        new_s += i

if new_s == new_s[::-1]:
    print('Return')
else:
    print('Continue')

a=input().strip()
st=""
x=""
mul=0
t=0
for i in a:
    if i in "1234567890":
        mul=mul*10+int(i)
    elif i=="-":
        st+=x*mul
        x=""
        t=0
        mul=0
    elif t==1:
        x+=i
    elif i=="+":
        t=1
    else:
        st+=i
if st==st[::-1]:
    print("Return")
else:
    print("Continue")