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 <iostream>

int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    char str[21];
    std::cin >> str;

    int cnt = 0;
    while (str[++cnt]);

    while (cnt-- > 0)
        std::cout << str[cnt];
    std::cout << std::endl;
}

C++: #include <map>
#include <string>
#include <iostream>
#include<vector>
#include <set>
#include<math.h>
#include<algorithm>

using namespace std;

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

C++: #include <iostream>

using namespace std;
int main(){
string str;
cin>>str;

for(int i=str.size();i--;){
    cout<<str[i];
}

}

C++: #include <iostream>
#include <string>
#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;

#define MAX 256

int main(void){
	int i;
	int l = 0;
	char str[21];
	char str1[21];
	cin >> str;
	for (i = 0; str[i] != '\0'; i++){
	}
	for (int k = i-1; k>=0;l++,k--){
		cout << str[k];
	}
	cout << endl;
	
	return 0;
}

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


using namespace std;

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

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

int main(){

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

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

putchar('\n');

return 0;		
}

C++: #include <iostream>

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<iostream>
#include<stdio.h>
#include<string>
using namespace std;

int main(){
  string s,t;
  cin >> s;
  int i=0;
  int k;
  while(s[i]!='\n'){
    i++;
    }
  for(k=i;k>=0;k--){
    printf("%c",s[k]);
  }
  return 0;
}

C++: #include<stdio.h>

int main(){
  char string[22];
  char revString[22];
  int i,s;

  fgets(string,20,stdin);
  for(i = 21;string[i] != '\n';i--){
    if(i == 0){
      break;
    }
  }
  i--;
  for(s = 0;i >= 0;i--){
    revString[s] = string[i];
    s++;
  }
  revString[s] = '\0';

  printf("%s\n",revString);

  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 <algorithm>
#include <string>

#define SIZE 21

int main(void)
{
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);

  char input[SIZE];
  std::cin.getline(input, sizeof(input));
  std::string str = std::string(input);

  std::reverse(str.begin(), str.end());

  std::cout << str << std::endl;

  return 0;
}

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

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

	return 0;
}

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

using namespace std;

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

C++: #include<iostream>

using namespace std;

char str[20];

int main()
{
	cin>>str;
	for(int i=0;i<20;++i)
	{
		if(str[19-i]!=0)
		{
			printf("%c",str[19-i]);
		}
	}

}

C++: #include <iostream>
using namespace std;
int main(){
  string s;
  cin >> s;
  cout << string(s.rbegin(), s.rend()) << endl;
  return 0;
}

C++: #include <iostream>
#include <cstdio> 
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <complex>
using namespace std;

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

#ifndef typeof
#define typeof __typeof__
#endif // typeof
 
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define tr(c, i) for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define rtr(c, i) for(typeof((c).rbegin()) i = (c).rbegin(); i != (c).rend(); i++)
#define repby(i, a, b, step) for(typeof(b) i = (a); i < (b); i += (step))
#define repab(i, a, b) repby(i, (a), (b), 1)
#define rep(i, n) repab(i, 0, (n))
#define pb push_back
#define sz(c) int((c).size())

void reverse(string &s)
{
        int i, j;
        char c;

        for (i = 0, j = sz(s) - 1; i < j; i++, j--) {
                c = s[i];
                s[i] = s[j];
                s[j] = c;
        }
}

int main(int argc, char **argv)
{
        string s;
        while (cin >> s) {
                reverse(s);
                cout << s << endl;
        }

  return 0;
}

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

using namespace std;

typedef unsigned long long ull;
#define loop(i,a,b) for(int i=(a);i<ull(b);++i)
#define rep(i,n) loop(i,0,n)
#define all(a) (a).begin(), (a).end()

const double eps = 1e-10;
const double pi  = acos(-1.0);
const double inf = (int)1e8;

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

C++: /*Filename: aoj0006.cpp
 *Author: Mushiyo
 */

#include <iostream>

using namespace std;

int main(){
	string str;

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

	return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
	char t[21];
	char flug=0;
	cin>>t;
	for(int i=20;i>=0;i--){
		if(flug==1){
			cout<<t[i];
		}
		if(t[i]=='\0'){
			flug=1;
		}
	}
	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>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
#define BOUND(Itr,val) lower_bound((Itr).begin(),(Itr).end(),(val))
typedef long long ll;

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

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

using namespace std;

int main() { 
    string A; 

    while( cin >> A ) {

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

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


int main() {

	string str;
	char a[20];
	int size = 0;
	cin >> str;

	for (int i = 0;;i++) {
		if (str[i] == '\0')break;
		size++;
	}

	for (int i = size; i > 0; i--) {
		printf("%c", str[i - 1]);
	}
	printf("\n");

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

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