Problem:
 Score : 100 points    Problem Statement You are given a string S of length 2 or 3 consisting of lowercase English letters. If the length of the string is 2 , print it as is; if the length is 3 , print the string after reversing it.      Constraints  The length of S is 2 or 3 .  S consists of lowercase English letters.         Input Input is given from Standard Input in the following format:  S       Output If the length of S is 2 , print S as is; if the length is 3 , print S after reversing it.        Sample Input 1 abc      Sample Output 1 cba  As the length of S is 3 , we print it after reversing it.       Sample Input 2 ac      Sample Output 2 ac  As the length of S is 2 , we print it as is.

Solution (Python):
a = list(input())
if len(a) == 2:
    print("".join(a))
else:
    b = [a[2],a[1],a[0]]
    print("".join(b))

Solution (Python):
s = input()
if len(s) == 2:
    print(s)
else:
    t = ''
    for i in range(1, len(s) + 1):
        t += s[(-1) * i]
    print(t)

Solution (Python):
from sys import stdin



S = stdin.readline().rstrip()
if len(S) == 2:
    print(S)
else:
    ans = S[2] + S[1] + S[0]
    print(ans)

Solution (Python):
s = input()
if(len(s) == 2):
  print(s)
else:
  print(s[::-1])

Solution (Python):
S = input()

if len(S) == 2:
    print(S)
else:
    print(S[::-1])

Solution (Python):
S = input()

if len(S) == 2:
    print(S)
elif len(S) == 3:
    print(S[::-1])

Solution (Python):
def main():
    S = input()
    if (len(S)==2):
        return S
    else:
        return S[::-1]

if __name__ == "__main__":
    print(main())

Solution (Python):
s = str(input())

if len(s)==2:
    print(s)
elif len(s)==3:
    print(s[2]+s[1]+s[0])

Solution (Python):
n=input()
n2=""
if len(n)==2:
    print(n)
else:
    for i in range(3):
        n2=n2+n[2-i]
    print(n2)

Solution (Python):
S=raw_input()
if len(S)==2:
	print S
else:
	print S[::-1]

Solution (Python):
S = list(input())
if len(S) == 3:
    S = S[::-1]
print(''.join(S))

Solution (Python):
S = list(input())

if len(S) == 2:
    print(''.join(S))
else:
    S.reverse()
    print(''.join(S))

Solution (Python):
s = input()

if len(s) == 2:
    print(s)
else:
    print("{}{}{}".format(s[2], s[1], s[0]))

Solution (Python):
S = input()
if len(S) == 2:
    print(S)
else:
    print(S[::-1])

Solution (Python):
from sys import stdin


def main() -> None:
    s = next_str()

    if len(s) == 2:
        print(s)
    else:
        print("".join(reversed(s)))


def next_str() -> str:
    result = ""
    while True:
        tmp = stdin.read(1)
        if tmp.strip() != "":
            result += tmp
        elif tmp != '\r':
            break
    return result


if __name__ == '__main__':
    main()

Solution (Python):

s = input()
if len(s) ==2:
    print(s)
else:
    print(s[::-1])

Solution (Python):
S = input()

if len(S) == 3:
    print(S[::-1])
else:
    print(S)

Solution (Python):
S = input()

if len(S) > 2:
    print(S[::-1])
else:
    print(S)

Solution (Python):
s = input()

if len(s) == 2:
    print(s)
elif len(s) == 3:
    print(s[::-1])

Solution (Python):

s=list(input())
ass = ''
if len(s) == 2:
    ass = s[0]+s[1]
else:
    ass = s[2]+s[1]+s[0]
print(ass)

Solution (Python):
S=input()
if len(S)==2: print(S)
else:
    for s in S[::-1]:
        print(s,end='')
    print('')

Solution (Python):
s = input()

if len(s)==2:
    print(s)
else:
    print(s[::-1])

Solution (Python):


S = input()

if(len(S) == 2):
    print(S)
else:
    print(S[2] + S[1] + S[0])

Solution (Python):
s = input().strip('\n')
if len(s)==3:
    print(s[::-1])
else:
    print(s)

Solution (Python):
s=input()
if len(s)==2:
    print(s)
else:
    print(s[2]+s[1]+s[0])

Solution (Python):
N = input()
a = N.split()
if len(N) == 2:
    print(N)
else:
    print(N[2]+N[1]+N[0])

Solution (Python):
sS = input().rstrip()
if len(sS) == 2:
    print(sS)
else :
    print(sS[::-1])

Solution (Python):
S = input()
if len(S) == 2:
    print(S)
else:
    print(S[::-1])

Solution (Python):
s = input()
print(s[2]+s[1]+s[0]) if len(s) == 3 else print(s)

Solution (Python):
s = str(input())
if len(s) == 2:
    print(s)
else:
    sl = list(s)
    sl.reverse()
    print("".join(sl))

Solution (Python):
S = input()

if len(S)==2:
    print(S)
else:
    print(S[2]+S[1]+S[0])

Solution (Python):
s = input()
print([s,s[-1::-1]][len(s) == 3])

Solution (Python):
s = input()
if len(s) == 2:
    print(s)
if len(s) == 3:
    print(s[2] + s[1] + s[0])

Solution (Python):
S = input()
if len(S) == 2:
    print(S)
elif len(S) == 3:
    print("".join(S[::-1]))

Solution (Python):
s=input()
print(s if len(s)==2 else s[::-1])

Solution (Python):
S=input()
if len(S)==3:
    S=S[::-1]
print(S)

Solution (Python):
S = input()

if len(S) == 3:
    print(S[-1] + S[-2] + S[-3])
else:
    print(S)

Solution (Python):
s = input()
if len(s)== 2:
    print(s)
else:
    print(s[::-1])

Solution (Python):
import sys,collections,math;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

s = S()
if len(s) == 2:
    print(s)
else:
    print(s[::-1])

Solution (Python):
str1 = raw_input().replace("\n", "")

if len(str1) == 2:
    print str1
else:
    print str1[::-1]

Solution (Python):
s = input()

if len(s) == 2:
	print(s)
else:
	s = s[::-1]
	print(s)

Solution (Python):
s = input()

if len(s) == 3:
  print(s[::-1])
else:
  print(s)

Solution (Python):
s=input()
if len(s)==2:
    print(s)
else:
    s=list(s)
    s.reverse()
    print(''.join(s))

Solution (Python):
N=input()
if len(N)==2:
    print(N)
    exit()
else:
    print(N[2]+N[1]+N[0])
    exit()

Solution (Python):
s = input()

if len(s) == 2:
    print(s)
else:
    print(s[::-1])

Solution (Python):
S = input()
if len(S) == 2:
    print(S)
else:
    print(S[-1::-1])

Solution (Python):
s = input()
if len(s)==2:
 print(s)
else:
 print(s[2]+s[1]+s[0])

Solution (Python):
s = input()
if len(s) ==2:
    print(s)
else:
    print(s[::-1])

Solution (Python):
S = input()

if len(S) == 2:
    print(S)
else:
    print(S[2]+S[1]+S[0])

Solution (Python):
s = list(input())
if len(s) == 2:
    print(''.join(s))
elif len(s) == 3:
    print(''.join(s[::-1]))

Solution (Python):
S = input()
if len(S) == 2:
  print(S)
elif len(S) == 3:
  print(S[::-1])

Solution (Python):






S = input()

if len(S) == 2: print(S)
else: print(S[::-1])

Solution (Python):
S=input()
if len(S)==3:
    print(S[::-1])
else:
    print(S)

Solution (Python):


from collections import deque
import itertools as it
import sys
import math

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

S = raw_input()

print S if len(S) == 2 else S[::-1]

Solution (Python):
N = input()

if len(N) == 2:
    print(N)
else:
    print(N[-1]+N[-2]+N[-3])

Solution (Python):
s = input()
if len(s) == 2: print(s)
else: print(s[::-1])

Solution (Python):
listS= list(input())
if len(listS)==2:
    print("".join(listS))
else:
    listS.reverse()
    print("".join(listS))

Solution (Python):
n = input()
if len(n) == 2:
    print(n)
else:
    print(n[::-1])

Solution (Python):
s = input()

if len(s) == 2:
    print(s)
else:
    print(s[::-1])

Solution (Python):
from sys import stdin

def main():
    S = input()

    if len(S) > 2:
        print(S[::-1])
    else:
        print(S)

input = lambda: stdin.readline().rstrip()
main()

Solution (Python):
s = input()
if len(s) == 2:
  print(s)
else:
  print(s[::-1])

Solution (Python):


s=input()
if len(s)==2:
  print(s)
else:
  print(s[2]+s[1]+s[0])

Solution (Python):
s = input()

if len(s) == 2:
    print(s)

if len(s) == 3:
    print(s[::-1])

Solution (Python):
s = input()
print(s if len(s)==2 else s[::-1])

Solution (Python):
S = list(input())
if len(S) == 2 :
    print("".join(S))
else :
    S = list(reversed(S))
    print("".join(S))

Solution (Python):
def getN():
    return int(input())


def getNM():
    return map(int, input().split())


def getList():
    return list(map(int, input().split()))

s = input()

if len(s) == 2:
    print(s)

if len(s) == 3:
    print(s[::-1])

Solution (Python):
s = input()

if len(s) == 2:
    print(s)
else:
    print(s[::-1])

Solution (Python):
l = input()
if len(l) == 2:
    print(l)
else:
    print(l[::-1])

Solution (Python):
s=input()
if(len(s)<3):print(s)
else:print(s[::-1])

Solution (Python):
S = input()

if len(S) == 2:
    print(S)
else:
    print(S[::-1])

Solution (Python):
s = input()
if(len(s) == 2):
    print(s)
else:
    print(s[2] + s[1] + s[0])

Solution (Python):
S = input()
if len(S) == 3:
    print(S[::-1])
else:
    print(S)

Solution (Python):
S = input()
if len(S) == 2:
    print(S)
else:
    print(S[::-1])

Solution (Python):
from sys import stdin
il = lambda func=int: list(map(func, stdin.readline().rstrip().split()))
ils = lambda n, s="int(input())": [eval(s) for _ in range(n)]

s = input()
if len(s) == 2:
    print(s)
else:
    print(s[::-1])

Solution (Python):
S = input()
if len(S) == 2:
    print(S)
else:
    print(S[::-1])

Solution (Python):
n = input()
if len(n) == 2:
    print(n)
else:
    print(n[2]+n[1]+n[0])

Solution (Python):
S = input()
if len(S) == 2:
    print(S)
else:
    print(S[::-1])

Solution (Python):
S = input()
if len(S) == 2:
    print(S)
else:
    print(S[::-1])

Solution (Python):
s = input()
if len(s)==2:
  print(s)
else:
  print(s[::-1])

Solution (Python):
S = input()
if len(S) == 2:
    print(S)
else:
    print(S[::-1])

Solution (Python):
s=input()
if(len(s)==2):
    print(s)
else:
    print(s[::-1])

Solution (Python):
S = input()

if len(S) == 2:
    print(S)
else:
    print(S[::-1])

Solution (Python):
S = input()

if len(S) == 2:
    print(S)
else:
    print(S[::-1])

Solution (Python):
l = input()
if len(l) ==3:
  print(l[::-1])
else:
  print(l)

Solution (Python):

def t118A():
    S = input()
    if len(S) == 2:
        print(S)
    else:
        print(S[::-1])
t118A()

Solution (Python):
a = input()
if len(a) == 2:
	print(a)
else:
	print(a[::-1])