Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func ReverseSequence(s []string) {
	defer fmt.Println()

	for i := 0; i < len(s); i++ {
		defer fmt.Print(s[i])
	}
}

func main() {
	sc.Scan()
	strs := strings.Split(sc.Text(), "")

	ReverseSequence(strs)
}

C++: #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<math.h>
#define L(_i,_N) for(int _i=0;_i<_N;_i++)
#define C(_Dis) cout<<_Dis<<endl;

using namespace std;

typedef long long int lli;

int main() {
	string Str;
	cin >> Str;
	reverse(Str.begin(),Str.end());
	C(Str);
	return 0;
}

C++: #include <bits/stdc++.h>
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(){
	int i;
	string str;
	
	cin >> str;
	
	for(i=str.size()-1;i>=0;i--){
		cout << str[i];
		if(i==0){
			cout << endl;
		}
	}
	
	return 0;
}

C++: #include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
int main()
{
    char str[22];
    int i,j;
    cin>>str;
   /* for(i=0;;i++)
    {
        if(str[i]=='\0')
        break;
    }*/
    int l=strlen(str);

    for(j=l-1;j>=0;j--)
    {
        cout<<str[j];
    }
    return 0;
}

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

using namespace std;

main() {
	char str[100];
	int len=0;
	int i;
	scanf("%s",str);

	len=0;
	while(str[len] != '\0') {
	len++;
		}

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

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

int main() {
	char str[21];
	cin >> str;
	int length = std::strlen(str);
	int x;
	for (int i = 0; i < length; i++){
		x = length - i - 1;
		cout <<str[x];
	}
	cout << "\0\n";
	return 0;
}

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

int main(){
	char ori[20], rev[20];
	cin >> ori;
	
	int size = 0;

	for(int i = 0; ori[i] != 0; i++){
		size++;
	}

	
	for(int i = 0; i < size; i++){
		rev[i] = ori[size-1-i];
	}
	rev[size] = 0;
	
	cout << rev << endl;
	
	return(0);
}

C++: //
// Created by Undefined on 2018/2/2.
//

#include <iostream>
#include <cstring>

using namespace std;

int main () {
    char s[21], tmp;
    gets(s);
    for (int i = 0, j = strlen(s) - 1; i < j; i++, j--) {
        tmp = s[i];
        s[i] = s[j];
        s[j] = tmp;
    }
    printf("%s\n", s);
}

C++: #include <stdio.h>

int main(){

	char str[20] = {},i;
	
	scanf("%s", str);
	
	for (i = 0; i < 20; i++){
		if (str[19 - i] >0){ printf("%c", str[19-i]); }
	}printf("\n")

	return 0;
}

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

int main()
{
	string inp;

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

C++: #include<iostream>

char str[21];

int main(){
	std::cin >> str;
	int i = 0;
	for(;str[i] != '\0'; i++);
	i--;
	for(;i>=0; i--)
		std::cout << str[i];
	std::cout << std::endl;
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;

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

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

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

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

using namespace std;

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


	return 0;
}

C++: #include<iostream>
#include<vector>
#define N 20

using namespace std;

int main() {

	vector<char> str(20);

	int i = 0,j;

	while(cin >> str[i]){
		i++;
	}

	for(j = i-1;j >=0;j--){
		cout << str[j];
	}
	cout << endl;
	
	return 0;
}

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

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

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

    for (int i=str.length();i>=0;--i)
    {
        std::cout << str[i];
    }
}

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

int main(){
	char str[30], *end_p;
	int end;;
	cin >>str;
	
	end_p = strrchr(str, '\0');
	end = end_p - str;
	
	for(int i = (end - 1); i >= 0; i--){
		cout <<str[i];
	}
	
	cout <<endl;
	return 0;
}

C++: #include<iostream>
#include<cstring>
using namespace std;
#define F(I,N) for(int I=0;I<N;I++)
void swap(char *a,char *b){
	char t=*a;
	*a=*b;
	*b=t;
}

int main(){
	char str[30];
	while(cin>>str){
		int l=strlen(str);
		F(i,l/2) swap(&str[i],&str[l-i-1]);
		cout<<str<<endl;
	}
	return 0;
}

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

using namespace std;

int main(int argc, char *argv[]) {
  string str;

  cin >> str;
  string::reverse_iterator itr = str.rbegin();
  while (itr != str.rend()) {
    cout << *itr;
    itr++;
  }
  cout << *itr << endl;
  return 0;
}

C++: //--------------------------------------------------template----------------------------------------//
//c
#include <stdio.h>
#include <time.h>
#include <math.h>
//c++
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <complex>
#include <cmath>
//c++11
#include <tuple>
#define all(c) ((c).begin(),(c).end())
#define rall(c) (c).rbegin(),(c).rend()
//#define sort(v,n) sort(v,v+n)
//#define vsort(v) sort(v.begin(),v.end())
#define vvsort(v) sort(v.rbegin(),v.rend())
#define ll long long
#define pb(a) push_back(a)
#define fi first
#define se second
#define inf 999999999
using namespace std;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
//---------------------------------------------------------------------------------------------//
string s;

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

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){
        std::cout << que.front();
        que.pop();
    }
    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;
    return 0;
}

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

int main(void){

  char word[25];
  int i,length;
  
  cin >> word;
  length = strlen(word);
  
  for(i = length + 1; i >=0; i--){
   cout << word[i];
  }
  
  cout << endl;
  
  return 0;

}

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

using namespace std;

int main(void){

  string hoge;

  cin >> hoge;

  for( int i = hoge.size() ; i >= 0 ; i-- ){
    cout << hoge[i]; 
  } 
  cout << endl;
  return 0;
}