output_description: If the length of S is 2, print S as is; if the length is 3, print S after
  reversing it.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
attempt: 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])
  
problem_description: 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.
samples: [{"input": "abc", "output": "cba\n    \n\nAs the length of S is 3, we print it after reversing it.\n\n* * *"}, {"input": "ac", "output": "ac\n    \n\nAs the length of S is 2, we print it as is."}]