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

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

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

int main(){
  char s[100];
  scanf("%s",s);
  int i=0;
  int k;
  while(s[i]!='\n'){
    i++;
    }
  for(k=i;k>=0;k--){
    printf("%c",s[k]);
  }
  return 0;
}

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

int main()
{
	string moji;
	char r_moji[20];

	cin >> moji;

	for(int i=0; i < moji.length(); ++i)
	{
		r_moji[i] = moji[moji.length()-(i+1)];
	}
	
	for(int i=0; i < moji.length(); ++i)
		cout << r_moji[i];

	return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
	string str;
	cin>>str;
	reverse(str.begin(),str.end());
	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 <iostream>
#include <string>
using namespace std;
int main()
{
	string s;
	cin >> s;
	for (int i = 0; i < s.length() / 2; i++)
	{
		int j = s.length() - 1 - i;
		char c = s[i];
		s[i] = s[j];
		s[j] = c;
	}
	cout << s << endl;
	return 0;
}

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

int main() {
    const int ARRAY_LENGTH = 20;
    char a[ARRAY_LENGTH] = "";
    cin >> a;
    for (int i = ARRAY_LENGTH; i > 0; i--) {
        if (a[i-1] == 0) {
           continue;
        }
        cout << a[i-1];
    }
    cout << endl;

    return 0;
}

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

using namespace std;

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

int main(){
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);

    std::string a;
    while (std::getline(std::cin, a)) {
        reverse(a.begin(), a.end());
        std::cout << a << std::endl;
    }
    return EXIT_SUCCESS;
}

C++: #include <iostream>

int main()
{
        int len = 0;
        char s[20];
        std::cin >> s;
        while(s[len] != '\0')
                ++len;
        while(len > 0)
                std::cout << s[--len];
        std::cout << std::endl;
        return 0;
}

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

using namespace std;

int main(){

    char str[30];

    while(gets(str)){

        int len = strlen(str);

        reverse(str,str+len);

        puts(str);
    }
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;
}

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

int main(){
	char str1[21] = "", str2[21] = "";
	cin >> str1;
	int a = 0;
	for(int i = 0;i < 21;i++){
		if(str1[20 - i] != '\0'){
			str2[a] = str1[20 - i];
			a++;
		}
	}
	cout << str2;
    return 0;
}

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

int main(void)
{
  int i;
  char str[21];
  cin >> str;
  
  for(i = 0; str[i] != '\0'; i++){
  }

  int j;
  char ans[21];

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

  cout << ans;

  return 0;
}

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

using namespace std;

int main(void){

  string s;

  cin >> s;

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

  cout << s << endl;

  return 0;
}

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

int main()
{
  using namespace std;

  string str;
  while (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 s[500];
    int l;
    gets(s);
    l=strlen(s);
    for(int i=l-1;i>=0;i--)
        {
            printf("%c",s[i]);
        }


    printf("\n");

    return 0;

}

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

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

C++: #include<stdio.h>
#include<iostream>
using namespace std;
int main(){
  char str[21];
  int i=0;
  cin>>str;
  while(1){
	  if(str[i]=='\0'){
		  break;
	  }
	  i++;
  }
  for(i>0;i--;){
	  cout<<str[i];
  }
  cout<<endl;

  return 0;
}

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

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

	return 0;
}

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

int main()
{
	int i, len=0;

	char str[21];

	scanf("%s",&str);

	len = strlen(str);

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

	return 0;
}

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

using namespace std;

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

C++: #include<iostream>
#include<iomanip>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<cstring>
#include<sstream>
using namespace std;
 
#define P(p) cout<<(p)<<endl
#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define rrep(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.begin(), v.end(),greater<int>());
#define YES cout<<"YES"<< endl
#define NO cout<<"NO"<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl  
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<endl
#define ret return
#define lb(v,n) lower_bound(v.begin(),v.end(),n)
#define ub(v,n) upper_bound(v.begin(),v.end(),n)
#define mae(v) max_element(v.begin(),v.end())
#define mie(v) min_element(v.begin(),v.end())

////////////////////////////////////////////////////////////

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

	rrep(i,s.size()  - 1, 0 )
		cout << s[i];
	cout << endl;
	ret 0;
}

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


int main()
{
	string str;

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

	return 0;
}

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

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

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

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

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