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<stdio.h>

int main(){
	int i;
	char s[21];

	scanf("%s",s);
	for(i=0;s[i]!='\0';i++);
	if(i>0) i--;
	for(;i>=0;i--) std::cout<<s[i];
	std::cout<<std::endl;
	
	return 0;
	}

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

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

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

#define rep(i,n) for(int i=0; i<n; i++)
int main(){
	string s;
	while(cin >>s){
		for(int i=s.length(); i>=0; i--) cout << s[i];
		cout << endl;
	}
    return 0;
}

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

C++: #include<iostream>
#include<string>
using namespace std;
int main()
{
  char s[21];
  cin >> s;
  int len = strlen(s);
  for(int i = len;i >= 0;i--){
    cout << s[i];
  }
  cout << endl;
}

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

char *reverse(char *s){
    int i,tmp;
    for(i=0; i<strlen(s)/2; i++){
        tmp = s[i];
        s[i] = s[strlen(s)-1-i];
        s[strlen(s)-1-i] = tmp;
    }
    return s;
}

int main(){

    char str[21];

    scanf("%s",str);
    printf("%s",reverse(str));

    return 0;
}

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

int main(){
	std::string s;
	std::cin >> s;
	for(std::string::reverse_iterator rit = s.rbegin(); rit != s.rend(); rit++){
		std::cout << *rit;
	}
	std::cout << std::endl;
	return 0;
}

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

int main() {
	string a,b;
	int l;
	l=a.size();
	cin >>a;
	for(int i=0;i<l;i++){
		b=a.substr(i,i)+b;
	}
	cout << b<<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;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD (int) (1e9+7)
#define INF (int) 2e9

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

C++: #include <stdio.h>

int main(){
	
	char a[25],b[25]={'0'};
	int s,t;
	
	scanf("%s",a);
	
	for(s=0;a[s]!='\0';s++)
	
	for(t=0;a[t]!='\0';t++){
		
		b[s-t]=a[t];
		
	}
	
	printf("%s",b);
	
	return 0;
}

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

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

#define pout(n)  printf ("%d\n", n)

#define rep(i,a,n) for (int i = a;i < n;i++)
#define per(i,n,a) for (int i = n-1;i >= a;i--)

const int d4x[4] = {1, 0, -1, 0};
const int d4y[4] = {0, 1, 0, -1};
const int d8x[8] = { 1,1,0,-1,-1,-1,0,1 };
const int d8y[8] = { 0,1,1,1,0,-1,-1,-1 };
 
typedef 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;
  reverse(str.begin(), str.end());
  cout << str << endl;
}

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

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

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

C++: #include <stdio.h>


int main(void){
    char st[20+1];
    char *pt;

    scanf("%s", st);
    for (pt=st; *pt!='\0'; pt++) ;
    for (pt--; pt!=st; pt--) printf("%c", *pt);
    printf("%c\n", *pt);
    return 0;
}

C++: #include <string>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#include <iomanip>


using namespace std;

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

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

int main()
{
	char str[21] = { 0 };
	char sc[21] = { 0 };
	int i, j, k, h;
	cin >> str;
	h=k=strlen(str);
	for(i=0; i < k; i++)
	{
		sc[k-i-1] = str[i];
	}
	cout << sc << endl;
}

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

int main(){

	char str[21];
	int i, l;

	cin >> setw(21) >>str;

	l = strlen(str);

	for( i=1; i<=l; i++ ){
		cout << str[ l - i ];
	}

	cout << endl;

	return 0;
}

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

int main()
{
  std::string str;
  while (std::cin >> str) {
    for (size_t  i = str.size() - 1; i != 0; --i) {
      std::cout << str[i];
    }
    std::cout << std::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 <iostream>
#include <string>
using namespace std;

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

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

C++: #include <iostream>

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>

using namespace std;

int main()
{
    string a;

    cin >> a;

    int PSa = a.length();

    for (int x = PSa-1; x >= 0; x--){
        cout <<a[x];
    }

    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

int main(){
	cin.tie(0),ios::sync_with_stdio(false);
	string str; cin>>str;
	for(auto i=str.rbegin();i!=str.rend();++i)cout<<*i;
	cout<<"\n"s;
}

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 = n - 1; i >= 0; i--){
        printf("%c", str[i]);
    }
    printf("\n");
    
    return 0;
}

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

using namespace std;

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

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

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

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

 cout << str << '\n';

 return 0;
}

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

}
return 0;
}

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