Go: package main

import (
        "fmt"
)

func main () {
        var str string
        fmt.Scanf("%s", &str)
        show(len(str)-1, str)
}

func show(n int, str string) {
        if n == 0 {
                fmt.Printf("%s\n", string(str[n]))
        } else {
                fmt.Printf("%s", string(str[n]))
                show(n-1, str)
        }
}

C++: /* -*- coding:utf-8 -*- */

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

int main()
{
  string s;
  cin >> s;
  string::reverse_iterator it = s.rbegin();

  while(it != s.rend()) {
    cout << *it;
    it++;
  }
  cout << endl;

  return 0;
}

C++: #include<cstdio>

int main(){
	char str[20];
	char c;
	int i = -1;
	scanf("%c", &c);
	while(c - 10){
		i++;
		str[i] = c;
		scanf("%c", &c);
	}
	for(; i >= 0; i--){
		printf("%c", str[i]);
	}
	printf("\n");
	return 0;
}

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

using namespace std;

int main()
{
    char s[20];
    int n,T;
    while(cin>>s){
       n=strlen(s);
       
       for(int i=0;i<(n/2);i++){
          T=s[i];
          s[i]=s[n-i-1];
          s[n-i-1]=T;        
       }             
       cout<<s<<endl; 
    }
    return 0;
}

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

int main(int argc, char *argv[]) {
	char rcv[21];
	char out[21];
	fscanf(stdin, "%s\n", rcv);
	int cnt = 0;
	for (int i = 0; i < 21; i++) {
		if (rcv[i] == '\0') {
			for (int j = i-1; j !=-1; j--) {
				out[cnt] = rcv[j];
				cnt++;
			}
			out[cnt] = '\0';
			break;
		}
	}
	printf("%s\n", out);
	
	return 0;
}

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

using namespace std;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  
  string str;
  cin >> str;
  reverse(str.begin(), str.end());
  cout << str << endl;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
int main()
{
  std::string s;
  while (std::cin >> s) {
    std::reverse(s.begin(), s.end());
    std::cout << s << std::endl;
  }
  return 0;
}

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

using namespace std;

int main()
{
	char str[21];
	stack<char> stk;

	fgets( str, sizeof( str ) - 1, stdin );

	for ( int i = 0; str[i] != '\n'; i++ )
	{
		stk.push( str[i] );
	}

	while ( !stk.empty() )
	{
		putchar( stk.top() );
		stk.pop();
	}	

	return 0;
}

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

void main()
{
 char str[20],temp;
 int i,j=0;
 gets(str);
 i=0;
 j=strlen(str)-1;

 while(i<j)
     {
     temp=str[i];
     str[i]=str[j];
     str[j]=temp;
     i++;
     j--;
     }

 printf("%s",str);
 return 0;
}

C++: #include<iostream>
#include<cstring>
using namespace std;
int main(void){
  string str;
  int len;

  while(cin >> str){
  len=str.length();

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

  }
  cout << endl;
  }
  return 0;

}

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

C++: #include <stdio.h>
#include <string.h>
int main()
{
   char a[20];
   gets(a);
   strrev(a);
   printf("%s\n",a);
   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];
    }
    res[n] = '\0';
    printf("%s\n",res);
    return 0;
}

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

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

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

using namespace std;

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

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

using namespace std;

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

}

C++: #include <iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<queue>
#include<stack>
#include<stdio.h>
#include<vector>
#include<set>
#include<map>
#include<iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
typedef int long long ll;

using namespace std;
int main(){

    string s;
    cin>>s;
    reverse(s.begin(),s.end());
    cout<<s<<endl;




return 0;
}

C++: #include <bits/stdc++.h>
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<stdio.h>
#include<iostream>
#include<math.h>
#include<algorithm>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<stdlib.h>
#include<ctype.h>
#include<map>
#include<iomanip>
#define r 6371.01
#define pi 3.141592653589
#define PI acos(0.0)
#define EPS 1e-7

using namespace std;
int main()
{
    char str[20];
    scanf("%s",&str);
    printf("%s\n",strrev(str));
    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 << endl;
}

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

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 <algorithm>
using namespace std;
int main(void)
{
	string ss;
	
	cin>>ss;
	reverse(ss.begin(),ss.end());
	cout<<ss;
	return 0;
}

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

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

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

using namespace std;

int main(){
    int size;
    char str[21];
    cin >> setw(21) >> str;
    size = strlen(str);
    for(int i=size-1;0<=i;i--){
        cout << str[i];
    }
    cout << endl;
    return 0;
}

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

using namespace std;

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

    return 0;
}

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

using namespace std;

int main()
{
	string S;

	cin >> S;

	for (string::size_type i = S.size() - 1; i >= 0; i--)
	{
		cout << S[i];
	}

	cout << endl;

	return 0;
}

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

char str[20];
int i,len;
int main(){
	gets(str);
	len = strlen(str);
	for(i=len-1;i>=0;i--){
		printf("%c",str[i]);
	}
}

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

using namespace std;
// cin >>
// cin <<
int main(){
	string a;
	int output;
	cin >>a;
	for(int i=(int)a.size();i>=0;i--){
		cout <<a[i];
	}
	return 0;
}

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

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

C++: #include<bits/stdc++.h>
int main()
{
    int m,n,i,j,k,l;
    char a[400];
    while(scanf("%s",&a)==1)
    {
       strrev(a);
       printf("%s",a);
       printf("\n");
    }
    return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;
int main() {
  string s;
  cin >> s;
  while(!s.empty()) {
	cout << s.back();
	s.pop_back();
  }
  cout << endl;
  return 0;
}

C++: #include <iostream>
#include <string>
#include <map>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <complex>
#define rep(i, b) for(int i = 0; i < (b); i++)
#define repi(i, a, b) for(int i = (a); i < (b); i++)
#define repd(i, a, b) for(int i = (a); i >= (b); i--)
#define ALL(u) (u).begin(), (u).end()
#define INF 100000000

using namespace std;
typedef long long ll;

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