Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func read() string {
	sc.Scan()
	return sc.Text()
}

func main() {
	sc.Split(bufio.ScanLines)
	s := read()
	rv := ""
	cols := strings.Split(s, "")
	for i := 0; i < len(cols); i++ {
		rv += cols[len(cols)-1-i]
	}
	fmt.Println(rv)
}

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

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

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

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

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

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

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

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

int main(){
    std::string str;
    std::queue<char> que;
    std::cin >> str;
    const int size = str.size();
    for(int i = 0; i < size; ++i){
        que.push(str.back());
        str.erase(str.size() - 1, 1);
    }
    for(int i = 0; i < size; ++i){
        if(i != size - 1){
            std::cout << que.front();
            que.pop();
        }else{
            std::cout << que.front() << std::endl;
        }
    }
    return 0;
}

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

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

	for(int i = str.length()-1; i >= 0 ; --i)
		std::cout << str.at(i);

	std::cout << std::endl;


  return 0;
}

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

using namespace std;

void sort(char *str){
	int len, len2 = 0;
	char work; 
	len = strlen(str);

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

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

	return 0;
}

C++: #pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>

using namespace std;
using Int = long long;
typedef pair<int,int> Pi; typedef pair<Int,Int> Pl;
constexpr int mod = 1e9+7;
constexpr int INF32 = numeric_limits<int>::max();
constexpr Int INF64 = numeric_limits<Int>::max();
#define END {cout<<ans<<'\n'; return 0;}
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define Pr(t) priority_queue<t>
#define gPr(t) priority_queue<t,vector<t>,greater<t>>
#define V(t) vector<t>
#define rer(i,l,r) for(int(i)=(l); (i)<(r); ++(i))
#define rep(i,n) rer(i,0,n)
#define gnr(i,l,r) for(int (i)=(r)-1; (i)>=(l); --(i))
#define pri(a) cout<<(a)<<'\n'
#define pri2(a,n) {rep(i,n-1)cout<<a[i]<<' '; if(n)cout<<a[n-1]<<'\n';}
#define prip(p) cout<<(p).fi<<' '<<(p).se<<'\n'
template<class T> inline bool cmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool cmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int n,m,_,x,y,q;
string s,sb;
bool ok;
char cf,cb;

int main(){
  cin.tie(nullptr); ios::sync_with_stdio(0);
  //cout<<fixed<<setprecision(20);
  
  cin>>s; reverse(ALL(s)); pri(s);
}

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

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iterator>
using namespace std;
int main(){
	string str;
	cin>>str;
	reverse(begin(str),end(str));
	cout<<str<<endl;
	int a;cin>>a;

	return 0;
}

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

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

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

#define MAX 256

int main(void){

	char k[21];
	int c = 0;

	scanf("%s", &k);

	for (int i = 0; k[i] != '\0'; i++){
		c++;
	}

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

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

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

C++: #include <stdio.h>

int main(void)	
{
	char str[21];
	
	int i, j;
	
	
	scanf("%s", str);
	
	for(i = 0; i < 21; i++)
	{
		if(str[i] == '\0')
		{
			for(j = i - 1; j >= 0; j--)
			{
				printf("%c", str[j]);
			}
			putchar ('\n');
			break ;
		}
		
	}
	
	return 0;
}

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

int main(void)
{
char str[256];
char rev[256];

for (int i = 0; str[i] != '\0'; i++){
rev[i] = str[strlen(str) - 1 - i;
}
rev[strlen(str)] = '\0';

printf("%s", rev);

return (0);
}

C++: #include <stdio.h>
int main()
{
    char ch[20];
    int i,j;
    gets(ch);
    j=strlen(ch);

    for(i=j-1;i>=0;i--)

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

    printf("\n");

    return 0;

}

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

int main()
{
	char str[20];
	int i;
	
	gets(str);
	
	for(i=strlen(str)-1; i>=0; i--) cout << str[i];
	
	return 0;
}

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

int main() {
  std::string s;
  std::getline(std::cin, s);

  for (std::string::reverse_iterator iter = s.rbegin();
       iter != s.rend(); ++iter) {
    std::cout << *iter;
  }
  std::cout << std::endl;
  return 0;
}

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

C++: print raw_input().strip()[::-1]

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

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

C++: #include<stdio.h>

int main(void)
{
	int i, len;
	char str[21], rev[21];

	scanf("%s", str );

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

	len = i - 1;

	for( i = 0; len >= 0; i++, len-- ){
		rev[i] = str[len];
	}

	rev[i] = '\0';

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

	return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;
int main(){
char a[40];
int len,b;
cin.getline(a,40);
len = strlen(a);
for(int i=len;i>=0;i--){
cout<<a[i];
}
cout<<\n<<endl;
return 0;
}

C++: //
//  main.cpp
//  CppTest
//
//  Created by Ryu on 2017/02/08.
//  Copyright ?? 2017??´ Ryu. All rights reserved.
//

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;

int main(int argc, const char * argv[]) {
    // insert code here...
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    char x;
    char str[20];
    int n = 0;
    while (cin.get(x)) {
        str[n] = x;
        //printf("%c", str[n]);
        n++;
    }
    
    
    for(int i = 0; i < n; i++){
        printf("%c", str[n - i - 1]);
    }
    printf("\n");
    
    return 0;
}