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):
S = input().rstrip('\n')
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:
  for i in range(len(S)):
    print(S[len(S) - i - 1],end = "")

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

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

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

Solution (Python):
s=input()
n=len(s)
print([s[-1]+s[1]+s[0],s][n==2])

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

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

Solution (Python):
s=input()

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

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

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

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

Solution (Python):
from sys import stdin
rs = lambda : stdin.readline().strip()
ri = lambda : int(rs())
ril = lambda : list(map(int, rs().split()))

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

if __name__ == '__main__':
    main()

Solution (Python):
s=list(input())
if len(s)==3:
    s=reversed(s)
print("".join(s))

Solution (Python):
a = input()

if len(a) % 2 == 0:
    print(a)
else:
    print(a[::-1])

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

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

Solution (Python):


a=input()

c=[]
for i in a:
    c.append(i)




if len(c)==2:
    print(a)
elif len(c)==3:
    c.reverse()
    print("".join(c))

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

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

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

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):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    S = input()

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


if __name__ == '__main__':
    main()

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


if __name__ == "__main__":
    main()

Solution (Python):

import sys
def input():
    return sys.stdin.readline()[:-1]

def main():
    S = input()

    T = S
    if len(S) == 3:
        T = ''
        for i in range(3):
            T += S[2 - i]
    print(T)

if __name__ == '__main__':
    main()

Solution (Python):

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve():
    S = input()
    if len(S) == 3:
        S = S[::-1]
    print(S)


def main():
    solve()


if __name__ == '__main__':
    main()

Solution (Python):

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
s = S()
ans = ''
if len(s) == 3:
    ans = s[::-1]
else:
    ans = s
print(ans)

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[2]+S[1]+S[0])

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):
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)
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()
print(s if len(s)==2 else s[::-1])

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

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

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

Solution (Python):
*S, = input()

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

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

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

if __name__ == "__main__":
    main()

Solution (Python):
'''
Created on 2020/08/20

@author: harurun
'''
def main():
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write
  
  S=pin()[:-1]
  if len(S)==2:
    print(S)
    return 
  print(S[::-1])
  return 

main()

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rf = lambda: map(float, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

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

Solution (Python):

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

Solution (Python):
S = input()
print([S, S[::-1]][len(S) % 2])

Solution (Python):
a=str(input())
if len(a)==2:
    print(a)
if len(a)==3:
    print(a[2]+a[1]+a[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 = str(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):
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 S)

Solution (Python):
s=input()

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

Solution (Python):
s = input()
print(s if len(s) == 2 else 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=list(input())
if len(s)==2:
  print(''.join(s))
else:
  print(''.join(reversed(s)))

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    S = input()
    if len(S)==2:
        print(S)
    else:
        print(''.join(list(reversed(S))))


if __name__ == '__main__':
    main()

Solution (Python):
s = input()

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

print(s)

Solution (Python):


import copy
import random
import bisect 
import fractions 
import math
import sys
import collections
from decimal import Decimal 

mod = 10**9+7
sys.setrecursionlimit(mod) 

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

S = list(str(input()))

if len(S) == 3:
    S.reverse()

print("".join(S))

Solution (Python):


import copy
import random
import bisect 
import fractions 
import math
import sys
import collections
from decimal import Decimal 

mod = 10**9+7
sys.setrecursionlimit(mod) 

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

S = list(str(input()))
if len(S) == 3:
    S.reverse()

print("".join(S))

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

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    S = SS()

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

if __name__ == '__main__':
    resolve()

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

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

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

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

Solution (Python):
import sys, math
from functools import lru_cache
from collections import deque
sys.setrecursionlimit(500000)
MOD = 10**9+7

def input():
    return sys.stdin.readline()[:-1]

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

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]


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


if __name__ == '__main__':
    main()

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

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:
    s = s[::-1]
print(s)

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

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

Solution (Python):
S = input()
a = 0
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=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(s[2]+s[1]+s[0])

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    S = input().rstrip()

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

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()

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

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

Solution (Python):
s = input()
print(s if len(s)==2 else 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) == 3:
  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:
    print(s[::-1])

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

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

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

Solution (Python):
S=input()
print(S[::(-1)**(len(S)%2)])

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):
s=input()
if len(s)==3:
  s=s[2]+s[1]+s[0]
print(s)

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:-len(S)-1:-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:
  s=list(reversed(s))
  print(*s,sep="")

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

Solution (Python):
s = input()

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

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

Solution (Python):


import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def isp():   return input().split()
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    s = input()
    n = len(s)
    print(s) if n == 2 else print(s[::-1])


if __name__ == "__main__":
    main()

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


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)==2:
  print(s)
else:
  print(s[::-1])

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7


S = input()

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

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

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

Solution (Python):


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    s=input()
    if len(s)==2:
        print(s)
    else:
        print(s[::-1])

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[::-1])

Solution (Python):
s = input()
print(s if len(s) == 2 else 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)
else:
  print(S[::-1])

Solution (Python):
s = input()

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    s=input()
    if len(s)==2:print(s)
    else:print(s[::-1])

if __name__=='__main__':
    main()

Solution (Python):
import heapq
from sys import stdin
input = stdin.readline


s = input()[0:-1]











     
def main():
    if len(s)==2:
        print(s)
    else:
        print(s[::-1])
    
if __name__ == '__main__':
    main()

Solution (Python):
s = input()
print(s if len(s) == 2 else 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):
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    s = input().rstrip()
    print(s if len(s) == 2 else s[::-1])


if __name__ == '__main__':
    resolve()

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

Solution (Python):
from sys import stdin
import math
import re
import queue

input = stdin.readline

MOD = 1000000007
INF = 122337203685477580

def solve():
    N = (input().rstrip())

    if(len(N) == 3):
        N= ''.join(list(reversed(N)))
    
    print(N)
if __name__ == '__main__':
    solve()

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[::-1])

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

Solution (Python):
s = input()
if len(s) == 2:
    print(s)

else:
    print("".join(reversed(s)))

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[::-1])

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

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

Solution (Python):


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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

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

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

Solution (Python):
s = input()

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():

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

resolve()

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

s = read().rstrip().decode()
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):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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

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)==2:
    print(s)
else:
    print(s[::-1])

Solution (Python):
s = input()
print(s[::-len(s)*2+5])

Solution (Python):
S = input()

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

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    s=input()
    if len(s)==2:print(s)
    else:print(s[::-1])

if __name__=='__main__':
    main()

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

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

Solution (Python):
s = input()                                 
print(s if len(s) == 2 else 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) == 3: print(S[::-1])
else: print(S)

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(''.join(list(reversed(s))))

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

Solution (Python):

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

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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10


def solve():
    s = S()
    if len(s) == 2:
        print(s)
    if len(s) == 3:
        print(s[::-1])
    return



if __name__ == '__main__':
    solve()

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

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

Solution (Python):
s = list(input())
if len(s) == 2:
    print(*s, sep="")
else:
    s.reverse()
    print(*s, sep="")

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

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

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

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):

def inputlist(): return [int(j) for j in input().split()]
from collections import Counter


S = list(input())
if len(S) == 2:
    print(''.join(S))
else:
    print(''.join(reversed(S)))

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

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 = list(input())

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

Solution (Python):
s=list(input())
if len(s) == 2:
    print(*s, sep='')
else:
    print(*(s[::-1]), sep='')

Solution (Python):
s=input()
ans=""

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

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

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


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) == 2):
    print(S)
else:
    print(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()
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()
print(s if len(s) == 2 else s[::-1])

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

Solution (Python):
from sys import stdin
S = stdin.readline().rstrip()
if len(S) == 2:
  print(S)
else:
  print(S[::-1])

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

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

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

if __name__ == "__main__":
    main()

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

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

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

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

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

Solution (Python):
s = input()
print(s if len(s) == 2 else 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 = 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) == 2:
  print(S)
else:
  s = S[2] + S[1] + S[0]
  print(s)

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

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

Solution (Python):
s = input().rstrip()
s_len = len(s)
if s_len == 2:
    print(s)
else:
    print("".join(list(s[::-1])))

Solution (Python):


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

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

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

Solution (Python):
a = input()
if len(a) == 2:
  print(a)
else:
  new_str = ''.join(list(reversed(a)))
  print(new_str)

Solution (Python):








mod = int(1e9+7)
INF = 1<<39

def main():
    s = input()
    if len(s) == 2:
        print(s)
    else:
        t = []
        for i in range(3):
            t.insert(0,s[i])
        print(''.join(t))
    return

if __name__=='__main__':
    main()

Solution (Python):
s = input()

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

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

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

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("{}{}{}".format(s[2],s[1],s[0]))

Solution (Python):
S=str(input())
ans=''
for i in range(len(S)):
    if len(S)==2:
        ans+=S[i]
    else:
        ans+=S[-1-i]
print(ans)

Solution (Python):

 
import math
import itertools
import sys
import copy
 





S = str(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:
    for ch in s[::-1]:
        print(ch, end='')

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

Solution (Python):
from sys import stdin

s = stdin.readline().rstrip()

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()

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

Solution (Python):
S = input()

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

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


if __name__ == '__main__':
    main()