Go: package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	for scanner.Scan() {
		str := []rune(scanner.Text())
		for i:=len(str)-1; i>=0; i-- {
			fmt.Printf(string(str[i]))
		}
		fmt.Println()
	}
}

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

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

using namespace std;

int main() {

	char str[20];
	int i, len;

	cin >> str;
	len = strlen(str);

	for (i = len - 1; i >= 0; i--)
		cout << str[i];

	putchar('\n');

	return 0;

}

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

int main(void){
	char c[21];
	scanf("%s", c);
	for(int i=strlen(c)-1; i>=0; --i){
		printf("%c", *(c+i));
	}
	return 0;
}

C++: #include<stdio.h>
#include<string.h>
char str[22];

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

C++: #include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <iostream>
#include <set>
using namespace std;
typedef long long ll;

string str;

int main(int argc, char const *argv[]) {
	cin >> str;
	reverse(str.begin(), str.end());
	cout << str << endl;
	return 0;
}

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

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

C++: #include <iostream>
#include <cstdio>
#define N 20
using namespace std;

int main() {
    char str[N];
    cin >> str;
    reverse(str,str+strlen(str));
    printf("%s\n",str);
    return 0;
}

C++: #include <iostream>
#include <fstream>
#include <string> 
#include <cstring>
#include <cmath>  
#include <cstdlib>
#include <ctime>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
#include <cctype>
#include <list>
//#include <boost/multiprecision/cpp_int.hpp>

#define BIT(a) (1 << (a))
#define EPS (1e-10)

using namespace std;
//using namespace boost::multiprecision;

const long long MOD = 1000000007;
const int COUNTER_CLOCKWISE = 1;
const int CLOCKWISE = -1;
const int ONLINE_BACK = 2;
const int ONLINE_FRONT = -2;
const int ON_SEGMENT = 0;

class Point{
    public:
    double x, y;

    Point(double x = 0, double y = 0): x(x), y(y) {}
    
    Point operator+(Point p){return Point(x + p.x, y + p.y);}
    Point operator-(Point p){return Point(x - p.x, y - p.y);}
    Point operator*(double a){return Point(a * x, a * y);}
    Point operator/(double a){return Point(x / a, y / a);}

    bool operator < (const Point &p) const {
        return y != p.y ? y < p.y : x < p.x;
    }

    double norm(){return x * x + y * y;}
};
typedef Point Vector;
typedef vector<Vector> Polygon;

double cross(Vector a, Vector b){
    return a.x*b.y - a.y*b.x;
}

double dot(Vector a, Vector b){
    return a.x * b.x + a.y * b.y;
}

int ccw(Point p0, Point p1, Point p2){
    Vector a = p1 - p0;
    Vector b = p2 - p0;
    if (cross(a, b) > EPS)return COUNTER_CLOCKWISE;
    if (cross(a, b) > -EPS)return CLOCKWISE;
    if (dot(a, b) < -EPS)return ONLINE_BACK;
    if (a.norm() < b.norm())return ONLINE_FRONT;

    return ON_SEGMENT;
}

Polygon andrewScan(Polygon s){
    Polygon u, l;
    if (s.size() < 3) return s;
    sort(s.begin(), s.end());
    u.push_back(s[0]);
    u.push_back(s[1]);
    l.push_back(s[s.size()-1]);
    l.push_back(s[s.size()-2]);
    
    for (size_t i = 2; i < s.size(); i++){
        for (size_t n = u.size(); n >= 2 && ccw(u[n-2], u[n-1], s[i]) == COUNTER_CLOCKWISE; n--){
            u.pop_back();
        }
        u.push_back(s[i]);
    }

    for (int i = (int)s.size() - 3; i >= 0; i--){
        for (size_t n = l.size(); n >= 2 && ccw(l[n-2], l[n-1], s[i]) == COUNTER_CLOCKWISE; n--){
            l.pop_back();
        }
        l.push_back(s[i]);
    }

    reverse(l.begin(), l.end());
    for (size_t i = u.size() - 2; i >= 1; i--) l.push_back(u[i]);

    return l;
}

long long mod_pow(long long x, long long n){
    long long res = 1;
    for(int i = 0;i < 60; i++){
        if(n >> i & 1) res = res * x % MOD;
        x = x * x % MOD;
    }
    return res;
}


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

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

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

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

}

C++: #include<iostream>
using namespace std;
int main () {
    string mozi;
    cin >> mozi;
    int y;
    y = mozi.length();
    for(i=0;i<y;++i){
        string reverse;
        reverse[i]=mozi[y-i];
    }
    cout << reverse << 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;
	
    return 0;
}

C++: #include <cstdio>
#include <cstring>
#define LOOP(index,times) for(int index=0;index<times;index++)
using namespace std;

int main(){

char str[21];
scanf("%s",str);

LOOP(i,strlen(str))
	printf("%c",str[strlen(str)-i]);
printf("%c\n",str[0]);

return 0;		
}

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

int main(){
    char str[21],res[21];
    int n;
    scanf("%s",str);
    n = strlen(str);

    for(int i = 0; i < n; i++){
        res[n - i - 1] = str[i];
    }
    printf("%s\n",res);
    return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;
int main() {
	string str;
	int n;
	cin >> str;
	n = str.length();
	for(int i = n - 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;

	for(int i=a.length()-1; i>-1; i--){
		cout << a[i];
		}
	cout << "\n";
	return 0;
}

C++: #include <bits/stdc++.h>
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++: //0006 Reverse Sequence
//^¦çê½¶ñð½]µ½àÌðoÍµÈ³¢
//È¨AüÍ³êé¶ñÍ20¶ÈºÆ·é

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;

int main(void)
{
	string str;
	while( cin >> str)
	{
		reverse(str.begin(), str.end());
		cout << str << endl;
	}
}

C++: #include<stdio.h>
#include<string.h>
int main(void)
{
	int i,x;
	char str[21];
	scanf("%s",str);
		x=strlen(str);
		for(i=x-1;i>=0;i--){
			printf("%c",str[i]);
		}
		printf("\n");
	return 0;
}

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

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

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

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

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

	return 0;
}