Go: package main

import (
        "fmt"
)

func main () {
        var str string
        fmt.Scanf("%s", &str)
        show(len(str)-1, str)
}

func show(n int, str string) {
        if n == 0 {
                fmt.Printf("%s\n", string(str[n]))
        } else {
                fmt.Printf("%s", string(str[n]))
                show(n-1, str)
        }
}

C++: #include<iostream>
#include<cstring>
using namespace std;
int main(){
  string str;
  int len;

  cin >> str;
  len=str.length();

  for(int i=len;i>=0;i--){
    cout << str[i] ;

  }

  cout << endl;

  return 0;



}

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

using namespace std;

int main() {
    int i,len;
    string ch;

    while(cin >> ch){

    len = ch.length();

    for(i = 0;i <= len / 2;i++){
        int box = ch[i];
        ch[i] = ch[len - i];
        ch[len - i] = box;
    }

    for(i = 0; i <= len;i++){
        cout << ch[i];
    }
    cout << endl;

    }

    return 0;
}

C++: #include <stdio.h>
int main(void){
    char s[21],*p;
    while(~scanf("%s",s)){
        for(p=s;*p++;);
        for(p--;s<=p;p--)printf("%c",*p);
        puts("");
    }
    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>
#include <cstdio>
using namespace std;

int main(){

  string str,ans;

  cin >> str;

 for(int i=0;i<str.size();i++){
   ans[str.size()-1-i]=str[i];
}

 for(int i=0;i<str.size();i++){
   cout << ans[i];
   }
 cout << endl;

  return 0;
}

C++: #include<stdio.h>



int main(){
	char c[20];

	scanf("%s",&c);
	int i;

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


	return 0;
}

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

int main(){
    string str;
    cin >> str;
    for(auto it=str.rbegin();it++!=str.rend();)cout << *it;
    return 0;
}

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

int main(){
char x[30];
int i=0;
while(cin>>x[i]){if(x[i]=='\0')break; i++;}
for(int j=i-1;j>-1;j++)cout<<x[i];}

C++: #include <iostream>
#include <string>
using namespace std;
int main(void){
    int len;
    string a;
    std::cin >> a;
    len =a.length();
    if(len <= 20){
        for(int i = len - 1; i >=0; i--){
            if( isupper( a.at(i) )  == 0)
                std::cout << a.at(i);
        }
    }
    
    return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	vector<char> s;
	char c[256];
	cin >> c;
	for (int i = 0; c[i] != NULL; i++)
	{
		s.push_back(c[i]);
	}
	if (s.size() <= 20){
		for (int i = 1; i < s.size(); i++)
		{
			int a = s.size();
			cout << s[a - i];
		}
	}
	return 0;
}

C++: #include <iostream>
#include <stdlib.h>
#include <string.h>
#include <string>
using namespace std;
void chstrrev(char *p)
{
	int loop=strlen(p)/2;
	char *R=p+strlen(p)-1,ch;
	while(loop--)
	{
		ch=*p;
		*p=*R;
		*R=ch;
		p++;
		R--;
	}
}
int main()
{
	char s[22]={0};
	cin>>s;
	chstrrev(s);
	cout<<s<<endl;
	return 0;
}

C++: #include <iostream>
 
using namespace std;
 
int main() {
    char str[25];
    for (int i=0;i<25;i++) {
    	str[i]='$';
    }
    cin >> str;
    int x;
    for (int i=0;;i++) {
    	if (str[i]=='$') {
    		x=i-1;
    		break;
    	}
    }
    for (int i=0;i<=x;i++) {
    	cout << str[x-i];
    }
    //cout << endl;
    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 <cstring>
using namespace std;

int main()
{
	char Str[21];
	int StrLen;

	cin >> Str;

	StrLen = strlen( Str );

	while( 1 ){

		cout << Str[StrLen-1];

		StrLen--;

		if( StrLen == 0 ) break;
	}

	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N); I++)
#define rep(i, n) FOR(i, 0, n)
#define FIN(V) cout<<V<<endl
#define pb push_back
#define INF (1 << 30)
typedef pair<int, int> P;
typedef long long ll;
typedef priority_queue<int> pq;
int StrToInt(string);
string IntToStr(int);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};

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

	return 0;
}



int StrToInt(string s){
	stringstream ss;
	ss << s;
	int val;
	ss >> val;
	return val;
}
string IntToStr(int i){
	stringstream ss;
	ss << i;
	return ss.str();
}

C++: #include<bits/stdc++.h>
using namespace std;
signed main()
{
     string a;
     cin>>a;
     reverse(a.begin(),a.end());
     cout<<a<<endl;
	}

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

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MP make_pair
#define PB push_back
#define MOD 1000000007
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
#define int ll

signed main(void)
{
  string s;
  cin >> s;

  REP(i, s.size()/2) {
    swap(s[i], s[s.size()-i-1]);
  }
  cout << s << endl;
  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 <stdio.h>
#include <stdlib.h>
#include <string.h>

#pragma warning(disable:4996)

int main()
{
	char str[21] = "\0";
	int X;

	scanf("%s", str);

	for (X = strlen(str)-1; X > 0; X--)
	{
		if (X <= (strlen(str) - 1) - X)
			break; 

		str[(strlen(str)-1) - X] ^= str[X];
		str[X] ^= str[(strlen(str)-1) - X];
		str[(strlen(str)-1) - X] ^= str[X];
	}
	printf("%s\n", str);

	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){

   string str;

   cin>>str;

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

   cout<<str<<endl;

   return 0;

}