Go: package main

import (
	"bufio"
	"os"
	"fmt"
)

func reverse(s string) string {
	runes := []rune(s)
	for i, j := 0, len(runes)-1; i < j; i, j = i+1, j-1 {
		runes[i], runes[j] = runes[j], runes[i]
	}
	return string(runes)
}

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Scan()
	input := scanner.Text()
	fmt.Println(reverse(input))
}

C++: #include<bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(unique(all(v)),v.end())
#define Eback(s) s.erase(s.end()-1,s.end())
#define rev(v) reverse(all(v))
#define minvec(v) *min_element(all(v))
#define maxvec(v) *max_element(all(v))
#define sumvec(v) accumulate(all(v),0LL)
#define mapmin(v) v.rbegin()->first
#define mapmax(v) v.begin()->first
#define pb push_back
#define pf push_front
#define m_p make_pair
#define DOUBLE fixed << setprecision(15)
#define OK cerr<<"OK\n"
#define OK1 cerr<<"OK1\n"
#define OK2 cerr<<"OK2\n"
#define SIZE(s) (int)s.size()
#define INF ((1LL<<62)-(1LL<<31))
#define zero(x,n) setw(x) << setfill('0') << n
#define endl '\n'

typedef long long ll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long> vll;
typedef vector<vll> vvll;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<string> vs;

typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<pair<int,int>> vpii;
typedef vector<pair<ll,ll>> vpll;

const double pi = acos(-1.0);
const ll mod=1000000007;
const ll mod2=998244353;

template<class A, class B>
ostream& operator<<(ostream& ost, const pair<A, B>&p) {
	ost << "{" << p.first << ", " << p.second << "} ";
	return ost;
}

template<class T>
ostream& operator<<(ostream& ost, const vector<T>&v) {
	ost << "{";
	for (int i = 0; i<(int)v.size(); i++) {
		if (i)ost << " ";
		ost << v[i];
	}
	ost << "} \n";
	return ost;
}

template<class A, class B>
ostream& operator<<(ostream& ost, const map<A, B>&v) {
	ost << "{";
	for (auto p:v) {
		ost << "{" << p.first << ", " << p.second << "} ";
	}
	ost << "} ";
	return ost;
}

template<class T>
inline bool chmax(T& a, T b){if(a<b){a=b;return true;} return false;}

template<class T>
inline bool chmin(T& a, T b){if(a>b){a=b;return true;} return false;}

void YES(bool b) {cout << ((b)?"YES\n":"NO\n");}
void Yes(bool b) {cout << ((b)?"Yes\n":"No\n");}
void yes(bool b) {cout << ((b)?"yes\n":"no\n");}
void Yay(bool b) {cout << ((b)?"Yay!\n":":(\n");}

ll powmod(ll a,ll b){ll c=1; while(b>0){ if(b&1){ c=a*c%mod; } a=a*a%mod; b>>=1; } return c;}
ll nCrmod(ll n,ll r){ll x=1,y=1; rep(i,r){x=x*(n-i)%mod; y=y*(i+1)%mod;} return x*powmod(y,mod-2)%mod;}
ll gcd(ll x, ll y) {return __gcd(x,y);}
ll lcm(ll x, ll y) {return x/__gcd(x,y)*y;}

int main()
{
	string s;
	cin >> s;
	reverse(all(s));
	cout << s << endl;
	return 0;
}

C++: #include<iostream>
#include<string>

using namespace std;

int main() {
  string s;
  cin >> s;
  reverse(s.begin(),s.end());
  cout << s << endl;
  return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

void main()
{
	char k[25];
	scanf("%s",k);
	reverse(k,k+strlen(k));
	printf("%s",k);
}

C++: #include<bits/stdc++.h>

using namespace std;

int main(){
  char str[21];
  cin >> str;
  for(int i=strlen(str)-1;i>=0;i--){
    printf("%c",str[i]);
  }
  cout << endl;
  return 0;
}

C++: #include<algorithm>
#include<iostream>
#include<string>
using namespace std;

#define rep(i,n) for(int i=0; i<n; i++)
#define swap(a,b) tmp=a, a=b, b=tmp
int main(){
	string s;
	cin >>s;
	for(int i=s.length(); i>=0; i--) cout << s[i];
	cout << endl;
    return 0;
}

C++: #include<iostream>
#include<string>
using namespace std;

int main()
{
	string str;
	cin >> str;
	for (int i = str.size() - 1; i >= 0; i--) {
		cout << str[i];
	}
	cout << endl;
    return 0;
}

C++: #include <iostream>
#include <string>

using namespace std;

int main()
{
    string a;

    cin >> a;

    int PanjangStringa = a.length();

    for (PanjangStringa-1; 0<=PanjangStringa; PanjangStringa--)

    cout <<a[PanjangStringa];
    return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;
int main() {
 string str;
 cin >> str;
 for (int i=str.size()-1;i>-1;i--) cout << str[i];
 cout << endl;
 return 0;
}

C++: #include<iostream>
#include<string>
using namespace std;
 int main(){
	 string A ;
	 char R;
	 cin>>A;
	 

	 for(int i =0; i<A.length()/2; i++){
		 R = A[i];
		
		 A[i]=A[A.length()-i -1] ;
		 A[A.length()-i-1]= R;
	 }

	 cout<<A<<endl;

	 return 0;


}

C++: #include <iostream>
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    char s[24];
    int n = cin.getline(s, 24).gcount();
    for(int i=n-1; i>=0; --i) cout<<s[i];
    cout<<'\n';
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
typedef long long ll;
typedef unsigned long long ull;

int main()
{
    string s;
    cin >> s;
    reverse(ALL(s));
    OP(s);
    return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int main(){
  string s;
  cin >> s;
  string ans;
  for(int i = 0; i < s.length(); i++){
    ans = s[i] + ans;
  }

  cout << ans << endl;
 
   
   
}

C++: #include <cmath>
#include <cstdlib>
#include <cstdio>

#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>

int main() {
  std::string str;

  std::cin >> str;

  for(int i = str.size()-1; i >= 0; --i) {
    std::cout << str[i];
  }
  std::cout << std::endl;

  return 0;
}

C++: #include <iostream>
#include <string>

int main(){
    std::string str;
    while(std::cin >> str){
        for(auto it=str.rbegin(); it!=str.rend(); ++it)
            std::cout << *it ;
        std::cout << std::endl;
    }
}

C++: #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <algorithm>
#include <iomanip>
#include <functional>
#include <numeric>

#define REP(i, n) for(int i = 0;i < (n); i++)
#define REP2(i, x, n) for(int i = (x); i < (n); i++)
#define REPR(i, n) for(int i = (n); i >= 0; i--)

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

#define LL long long int
#define LD long double

#define PI 3.14159265358979

using namespace std;

//================================================

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	string S; cin >> S; reverse(ALL(S)); cout << S << "\n";
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<cstdio>
#include<string>
typedef long long int ll;

using namespace std;


string back(string s){
	string ret="";
	for(int i=s.size()-1;i>=0;i--){
		ret+=s[i];
	}
	return ret;
}

int main(){
	string s;
	cin>>s;
	cout<<back(s)<<endl;
	return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;
int main()
{
	string s;
	cin>>s;
	for ( int i=0; i<(int)s.length(); i++ )
		cout << s[s.length()-i-1];
	cout<<endl;
	return 0;
}

C++: #include<iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
int main(){
  char str[21];
  scanf("%s",str);
  int len =strlen(str);
  for(int i=len-1;i>=0;i--){
    printf("%c",str[i]);
  }
  cout<<endl;
}

C++: #include<stdio.h>
#include<string.h>
#define MAX 30


int main()
{
	char str[MAX];
	scanf("%s",str);
	int num = strlen(str);
	int i;
	for(i=0;i<num;i++)
	{
		printf("%c",str[num-i-1]);
	}
	printf("\n");
	return 0;
}