Go: package main
import (
	"fmt"
	"os"
	"bufio"
)

var sc = bufio.NewScanner(os.Stdin)

func main(){
	sc.Scan()
	str := sc.Text()
	// rev_str := make([]string, len(str))
	defer fmt.Println()
	for _, v := range []rune(str){
		defer fmt.Print(string(v))
	}
}

C++: 
/*
 * main.cpp
 *
 *  Created on: 2011/04/03
 *      Author: satoki
 *      22:20 ~ 22:28
 */
#include <iostream>
#include <string.h>
using namespace std;

char cStr[21];

bool input() {
  scanf("%s", cStr);
  return true;
}

void manage() {
  int i;
  char tmp;
  for (i = 0; i < (int)string(cStr).size() / 2; i++) {
    tmp = cStr[i];
    cStr[i] = cStr[string(cStr).size() - i - 1];
    cStr[string(cStr).size() - i - 1] = tmp;
  }
}

int main() {
  input();
  manage();
  printf("%s\n", cStr);
  return 0;
}

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

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

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

using namespace std;

std::string reverse( std::string src ){
	std::string str = src;

	for( int i=0; i<src.size(); i++ )
		str[i] = src[src.size()-1-i];

	return str;
}

int main(void){
	string str;

	cin >> str;
	cout << reverse(str) << endl;

	return 0;
}

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

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;
	return 0;
}

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

int main(){

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

for(int i=0;i<strlen(str)+1;i++)
	putchar(str[strlen(str)-i]);

putchar('\n');

return 0;		
}

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

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

using namespace std;

void sort(char *str){
	int len, len3 = 0;
	char str2[20], work; 
	len = strlen(str);

	for(int len2 = 0; len > len2; len2++){
		str2[len2] = str[len2];
	}

	for(len = len - 1; len > len3; len--,len3++){
		work = str[len];
		str[len] = str[len3];
		str[len3] = work;
	}
}

int main(){
	char str[20];
	while (cin >> str) {
		sort(str);
		cout << str << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <algorithm>
#include <functional>

#define REP(i,n) for(int i=0; i<n; i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define ll long long

using namespace std;


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

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout<<V<<endl
#define pb push_back
#define INF (1 << 30)
typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};

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

	return 0;
}



int StrToInt(string s){
	stringstream ss;
	ss << s;
	int val;
	ss >> val;
	return val;
}
string IntToStr(int i){
	stringstream ss;
	ss << i;
	return ss.str();
}

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

using namespace std;

int main()
{
	string s, t;
	char c;
	
	while (getline(cin, s))
	{
		for (string::reverse_iterator it = s.rbegin(); it < s.rend(); it++)
		{
			t.push_back(*it);
		}
		
		printf("%s\n", t.c_str());
	}
	
	return 0;
}

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

//????????????????????§??????
int main()
{
	string str;
	cin >> str;

	for(int i = str.length() - 1; i > 0; i--)
		cout << str[i];

	return 0;
}

C++: #include<iostream>	
#include<string>
using namespace std;
char* reverse_str(char *a)
{
	int data_size = sizeof(*a) / sizeof(a[0])- 1;
	for(int i=0;i<=data_size;i++){
		char temp1 = a[i];
		a[i] = a[data_size-i];
		a[data_size-i] = temp1;
	}
	return a;
}

int main()
{
	char *a;
	char str[256];
	cin.getline(str,256);
	int data_size = sizeof(a) / sizeof(a[0])-1;
	for(int i=1;i<=data_size;i++)
		cout << str[data_size - i];
	return 0;
}

C++: #include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<iostream>
using namespace std;


int main() {
	
	char c[20];
	int size = 0;

	for (;;) {
		scanf("%c", &c[size]);
		if (c[size] == '\n')break;
		size++;
	}

	for (int i = size; i >= 0; i--) {

		printf("%c", c[i]);
	}

	printf("\n");

//	system("pause");
	return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cmath>

using namespace std;



int main()
{
	int i = 0;
	char a[20];

	scanf("%s", a);

	while (1) {
		i++;
		if (a[i] == '\0') break;
	}
	i--;
	while (i != -1) {
		printf("%c", a[i]);
		i--;
	}
	printf("\n");
	

		return (0);
	
}

C++: #include<iostream>
using namespace std;
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main()
{

    char str[20];
    int i,l;
    fflush(stdin);
	gets(str);

 for(i=0;str[i]!='\0';i++)
    {
        if(str[i]==' ')
        i++;
      l=i;

    }
//str[i]='\0';
    for(i=l;i>=0;i--)
    {
        printf("%c",str[i]);
    }

    return 0;
}

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

C++: #include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <stdlib.h>

using namespace std;


int main(){
	string str, ans;
	int i;
	cin >> str;

	for(i=0 ; i<str.size() ; i++){
		ans += str[str.size()-i-1];
	}

	cout << ans << endl;
	return 0;
}

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

C++: #include "bits/stdc++.h"

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;

#define dump(x)  cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb push_back

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

C++: #include <iostream>
#include <string>
#include <cctype>
#include <cmath>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <map> // pair
#include <set>
#include <string>

#define MAXSIZE 200000
#define PI 3.141592653589
using namespace std;




int main(){
  string s;
  std::cin >> s;


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

  std::cout  << '\n';
}

C++: #include <bits/stdc++.h>
using  namespace std;
#define ll    long long int
#define pai     pair<int,int>
#define vi      vector<int>
#define vd      vector<double>
#define mpi     map<int,int>
#define mps     map<string,int>
#define sti     stack<int>
#define stc     stack<char>
#define sei     set<int>
#define ses     set<string>
#define multii  multiset<int>

 int main()
{
 /*#ifndef ONLINE_JUDGE
  freopen("tin.txt","r",stdin);
  freopen("tout.txt","w",stdout);
  #endif*/
string s;
cin>>s;
reverse(s.begin(),s.end());
cout<<s<<endl;

}