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

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

 	return 0;
}

C++: string = input("input data")
size = len(string)
st = []
for i in range(size):
    st.append(string[size-i-1])
print(''.join(st), end='')

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

using namespace std;

int main() {
	string str;

	cin >> str;

	auto it1 = str.begin();
	auto it2 = str.end() - 1;

	while (it1 < it2) {
		swap(*it1++, *it2--);
	}

	cout << str << endl;
	return 0;
}

C++: #include<cstdio>
int main(){
    char ch[21];
    int sum;
    scanf("%s",ch);
    for(sum=0; ch[sum]!='\0'; sum++){}
    for(sum=sum-1; sum>=0; sum--)
        printf("%c", ch[sum]);
    printf("\n");
    return 0;
}

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

using namespace std;

int main(void){

  string str;

  cin >> str;

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

C++: #include <stdio.h>
#include <string.h>
int main() {char Tex[25];gets(Tex);for (int j=strlen(Tex)-1;j>=0;printf("%c",Tex[j--]));puts("");return 0;}

C++: #include<iostream>
using namespace std;
int main(){
	int i=0;
	char c[20];
	while(cin>>c[i]){
		if(49<=c[i] && c[i]<=126){
		}else{
			break;
		}
		i++;
	}
	for(;i>=0;i--){
		cout<<c[i];
	}
	cout<<endl;
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<cstring>
#define loop(i,a,b) for(int i=a ;i < b ; i++)
#define rep(i,a) loop(i,0,a)
using namespace std;

int main(void){
	string a;

	getline(cin,a);
	
	for(int i=a.size();0<i;i++);
	
	cout<<a<<endl;
	return 0;
}

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

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

int main()
{
	int i;
	int len;
	char str[20],copy[20];
	scanf("%s",str);
	len = strlen(str);
	for(i = 0; i < len; i++){
		copy[len - i - 1] = str[i];
	}
	for(i = 0; i < len; i++){
		str[i] = copy[i];
	}
	printf("%s\n",str);
	return 0;
}

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

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

C++: #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1e9 + 7, MOD = 1e9 + 7;
const long long LINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed 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 s;

  cin>>s;

  for(int i=s.size()-1;i>=0;++i)
    cout<<s[i];

  cout<<endl;

}

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

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

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

int main()
{
    char ch[20];
	int i=0;
	while(cin >> ch[i]){
		i++;
	}
	for(int j=i-1 ; j>=0 ; j--){
		cout<<ch[j];
	}
	cout<<endl;
	return 0;
}

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

using namespace std;

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

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

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

using namespace std;

int main(){
	string str1, str2;
	char tmp;
	int i, length;

	getline(cin, str1);
	length = str1.size();
	//cout << length << endl;
	str2.reserve(length+1);
	for(i=0;i<length;i++){
		tmp = str1.at(length - i - 1);
		//cout << tmp << endl;
		str2 += tmp;
	}
	//str2 += '\0';
	cout << str2 << endl;
	//getline(cin, str1);

	return 0;
}

C++: #include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <ctime>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <iostream>
#include <deque>
#include <complex>
#include <string>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <valarray>
#include <iterator>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) container.begin(), container.end()
#define RALL(container) container.rbegin(), container.rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;


string s;

main(){
	while(cin >> s){
reverse(ALL(s));
		cout << s << endl;
	}
	return 0;
}

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<stdio.h>
int main(){
    char str[20]={0},i;
    scanf("%s",&str);
    for(i=19;i>=0;i--){
        if(str[i]!=0)printf("%c",str[i]);
    }
    printf("\n");
    return 0;
}

C++: #include <stdio.h>

int main(void){
	char buff[128];
	char *p;
	scanf("%s",buff);
	p=buff;
	p=p+strlen(buff);
	while(p!=buff){
		putchar(*(--p));
	}
	putchar('\n');
	return 0;
}

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

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

C++: #include <stdio.h>

int main (void)
{
	char str[21], new_str[21];
	gets(str);
	
	int i;
	for(i=0; i<21; i++){
		new_str[i]='\0';
	}
	
	for(i=0; i<20; i++){
		if(str[i]=='\0' || str[i]=='\n'){break;}
		new_str[20-i]=str[i];
	}
	
	for(i=0; i<21; i++){
		if(new_str[i]!='\0'){printf("%c", new_str[i]);}
	}
	
	printf("\n");
	return 0;
}

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


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

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

using namespace std;

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