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++: main(a[20],i){for(i=0;~scanf("%c",&a[i]);i++);while(i--)printf("%c",a[i]);}

C++: #include <iostream>
#include <cstring>
using namespace std;
int main(){
	string str;
	cin>>str;
	int n=str.size();

	for(int i=n-1; i>=0; i--){
		cout<<str[i];
	}
	cout<<endl;
}

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

string ilham, bojos;
int ndaru;
int main(){
	cin >> ilham;
	ndaru = ilham.length();
	for(int i = ndaru-1; i >= 0; i-){
		bojos = bojos + ilham[i];
	}
	cout << bojos << "\n";
	
	return 0;
}

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

int main()
{
	char get[20] ;
	cin >> get ;

	int i = 0 ;
	char output[20] ;
	while( (strlen(get)-i) > 0 )
	{
		output[i] = get[strlen(get)-i-1] ;
		i ++ ;
	}

	output[strlen(get)] = '\0' ;
	cout << output ;

	return 0 ;
}

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

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

C++: #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>

using namespace std;

int gcd( int, int );

int main()
{
	char str[21];

	while ( fgets( str, sizeof( str ), stdin ) )
	{
		reverse( str, str + strlen( str ) );
		cout << str << endl;
	}

	return 0;
}

C++: #include<stdio.h>
int main(){
	char str[20];
	int i,j;
	scanf("%s",&str);
	
	/*
	for(i=0;i<20;i++){
		if(i=='\0'){
		for(j=i-1;j>0;j--){
			printf("%c",j);
		}
		}
	}
	*/
	
	for(i = 0; str[i] != '\0'; i++);
	
	for(j = i-1; j > -1; j--){
		printf("%c",str[j]);
	}
	
	puts("");
	
	return 0;
}

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

int main()
{
	char str[21];
	int i;
	cin >> str;
	i = strlen(str);
	for (i -= 1; 0 <= i; i--) {
		cout << str[i];
	}
	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<iostream>
using namespace std;
int main(void)
{
    char str[21];
    int i=0;
    while(cin>>str[i])
    {
        i++;
    }
    for(int j=i-1;j>=0;j--)
    {
        cout<<str[j];
    }
    cout<<endl;
    return 0;
}

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

int main(){
	const int max = 20; 
	char str[max + 1];
	char c;
	int count = 0;
	while(cin.get(c)){
		str[count] = c;
		count++;
	}
	for(int i = 1; i <= count-1; i++)
		cout << str[count - i - 1];
	cout << endl;
	return 0;
}

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

C++: //#define _GRIBCXX_DEBUG
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;


// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x; i<=(int)n; ++i)
#define ILP while(true)
#define FOR(i,c) for(__typeof((c).begin())!=(c).begin(); i!=(c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#pragma endregion

#pragma region TYPE_DEF
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;
#pragma endregion


// Effective std
#pragma region ESTD
template<typename C, typename T>
constexpr int count(C& c, T t) { return count(ALL(c), t); }
template<typename C, typename F>
constexpr int count_if(C& c, F f) { return count_if(ALL(c), f); }
template<typename C, typename T, typename U>
constexpr void replace(C& c, T t, U u) { replace(ALL(c), t, u); }
template<typename C, typename F, typename U>
constexpr void replace_if(C& c, F f, U u) { (ALL(c), f, u); }
template<typename C>
constexpr void sort(C& c) { sort(ALL(c)); }
template<typename C, typename Pred>
constexpr void sort(C& c, Pred p) { sort(ALL(c), p); }
template<typename C>
constexpr void reverse(C& c) { reverse(ALL(c)); }
#pragma endregion


// ?´???°
#pragma region PRIME
bool is_prime(unsigned n) {
  switch(n) {
    case 0:
    case 1: return false;
    case 2: return true;
  }
  if (n%2==0) return false;
  for (unsigned i=3; i*i<=n; i+=2)
    if (n%i==0) return false;
  return true;
}
#pragma endregion


// ??§??????/?°?????????????
#pragma region TRANSFORM
void mutal_tr(string &s) {
  for(int i=s.size(); i--;) {
    if(islower(s[i])) s[i] = toupper(s[i]);
    else if (isupper(s[i])) s[i] = tolower(s[i]);
  }
}
void to_upper(string &s) { for(int i=s.size(); i--;) s[i] = toupper(s[i]); }
void to_lower(string &s) { for(int i=s.size(); i--;) s[i] = tolower(s[i]); }
#pragma endregion


// ??????
#pragma region SET
template<class T>
set<T> intersection(const set<T>& sa, const set<T>& sb) {
  set<T> ret;
  for(T a : sa) if(sb.find(a) != sb.end()) ret.insert(a);
  return ret;
}
#pragma endregion

// Union Find
#pragma region UF
struct UnionFind {
  vector<int> data;
  UnionFind(int size) : data(size, -1) {}
  bool union_set(int x, int y) {
    x = root(x); y = root(y);
    if(x!=y) {
      if(data[y] < data[x]) swap(x, y);
      data[x] += data[y]; data[y] = x;
    }
    return x != y;
  }
  bool find_set(int x, int y) { return root(x) == root(y); }
  int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
  int size(int x) { return -data[root(x)]; }
};
#pragma endregion


// ?????°
#pragma region CONST_VAL
#define PI (2*acos(0.0))
#define EPS (1e-9)
#define MOD (int)(1e9+7)
#pragma endregion

int main()
{
    string s;
    cin >> s;
    reverse(s);
    P(s);

    return 0;
}

C++: #include <stdio.h>
#include <string.h>

int main(){
	int i;
	char str[256];
	char n[256];
	scanf("%s", str);
	int l = strlen(str);
	for(i=0;i<l;i++)
		n[i] = str[l-i-1];
	printf("%s", n);
}

C++: #include<iostream>
using namespace std;
int main(void){
    char str[21]="";
    cin >> str;
    for(int i=20; i>=0; i--){
        if(str[i]!='\0') cout << str[i];
    }
    cout << endl;
    return 0;
}

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

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

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

using namespace std;

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