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<string>

int main(){
	std::string st;
	std::cin >> st;
	
	while(!(st.empty())){
		std::cout << st.back();
		st.erase(st.begin() + st.size() -1);
	}
	std::cout << std::endl;
	return 0;
}

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

using namespace std;

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

C++: #include<iostream>
#include<cstdio>
#include<string>
#include<stdio.h>
//入力された文字列を逆順に出力
using namespace std;

int main(){
  char a[20];
  scanf("%s",a);
  for(int i =strlen(a)-1;i >=0;i--){
    putchar(a[i]);
  }
  return 0;
}

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

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

  while(cin >> str)
  {
    for(i = 0;str[i+1] != '\0';i++);
    for(;i != EOF;i--){
      cout << str[i];
    }
    puts("");
  }
}

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

C++: #include<cstdio>
#include<cstring>
int main(void){
	char a[21];
	int c;
	scanf("%s", a);
	c = strlen(a);
	for (int i = 1; i <= c; i++)printf("%c", a[c - i]);
	printf("\n");
	return 0;
}

C++: #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>

using namespace std;

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

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

C++: #include<iostream>
#include<string>
using namespace std;
int main(){
  string s;
  cin >>s;
  for(int i=1; i<=s.size(); i++){cout <<s[s.size()-i];}
  cout <<endl;
  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 <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
    char str[20],hold;
    while(gets(str))
    {
        int i=0,n=strlen(str);
        if(n==2)i++;
        while(i<=n/2)
        {
            hold=str[i];
            str[i]=str[n-i-1];
            str[n-i-1]=hold;
            i++;
        }
        str[n]='\0';
        puts(str);
    }
    return 0;
}

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

int main(){
    string s; cin >> s;
    for(int i=s.size()-1; i>=0; i--){
        cout << s.at(i);
    }
    cout << endl;

    return 0;
}

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];
	cout << endl;
}

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

using namespace std;

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

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

int main(){
    stack<char> str;
    char c;
    while(1){
        scanf("%c",&c);
        if(c=='\n'||c==EOF) break;
        str.push(c);
    }
    while(!str.empty()){
        printf("%c",str.top());
        str.pop();
    }
    printf("\n");
    return 0;
}

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

using namespace std;

int main(){
    string s;
    cin >> s;
    for( int i = s.size() - 1; i >= 0; i-- ){
        cout << s[i];
    }
    printf("\n");
    return 0;
}

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

using namespace std;

int main(void)
{
    string str;
    getline(cin, str);

    reverse(str.begin(), str.end());
    cout << str << endl;

    return 0;
}

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

main() {
  string s; cin>>s;
  for(string::reverse_iterator it = s.rbegin();it!=s.rend();it++)
    cout << * it;
  cout << endl;
}

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++){
        char 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 <iostream>
#include <string>

using namespace std;

int main(){
    string str;
    cin >> str;
    int i = 0,j = str.size() - 1;
    while(i < j){
    	string tmp;
    	tmp = str[i];
    	str[i] = str[j];
    	str[j] = tmp;
    }
    cout << str << endl;
}

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 <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i,N) for(int i = 0; i < (int)N; i++)


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

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

int main()
{
    string str;
    
    cin >> str;
    
    int i = str.size();
    
    reverse(&str[0], &str[i]);

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

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

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

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

int main(){
  std::string s,t;
  std::cin >> s;
  while( ! s.empty() ) {
    t += s[ s.size() - 1 ];
    s.erase( s.size() - 1 );
  }
  std::cout << t << std::endl;
  return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#define debug(x) cerr << #x << ':' << x << endl
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define ALL(c) (c).begin(), (c).end()
using namespace std;
typedef long long ll;

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

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

int main(void) {
  char s[100] = {0};
  int i = 0;
  scanf("%s", s);
  i = sizeof(s)-3;
  while(i >= 0)
  putchar(s[i--]);
  
  putchar('?\n');
  return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <stdio.h>
#include <string.h>
using namespace std;
int main()
{
    char str[50];
    while(cin>>str)
    {
        int len=strlen(str);
        for(int i=len-1; i>=0; i--)
            cout<<str[i];
    }
}

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

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

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

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