'''

def palindrom(sir):
if len(sir)<=1:
return True
return sir[0]== sir[len(sir)-1]and palindrom(sir[1:len(sir)-1])

s='abbcbba'
if palindrom(s):
print('Este palindrom')
else:
print('nu este palindrom')
##construiti o fc iterativa si recursiva care sa inverseze un si
'''
def Inv(sir):
return sir[::-1]
sir="Ana are mere"
print(sir)
sir=Inv(sir)
print(sir)

def InvRec(sir):
if len(sir)==0 :
return sir
return InvRec(sir[1:])+sir[0]
sir="Ana are mere"
print(sir)
sir=InvRec(sir)
print(sir)

##Permutari
import numpy as np
def valid(k):
for i in range(k):
if result[k]==result[i]:
return False
return True

def bkt(k):
for i in range(1,n+1):
result[k]=i
if valid(k):
if k == n-1:
print(result)
else: bkt(k+1)
else:
continue
n=int(input('n ='))
result=np.zeros([n],int)
bkt(0)