Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func main() {
	sc.Scan()
	s := sc.Text()
	l := len(s)
	r := make([]rune, l)
	for i, c := range s {
		r[l-i-1] = c
	}
	fmt.Println(string(r))
}

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 <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(void)
{
	string ss;
	
	cin>>ss;
	reverse(ss.begin(),ss.end());
	cout<<ss;
	return 0;
}

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

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

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

using namespace std;

int main(){
    int size;
    char str[21];
    cin >> setw(21) >> str;
    size = strlen(str);
    for(int i=size-1;0<=i;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 << endl;

    return 0;
}

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

using namespace std;

int main()
{
	string S;

	cin >> S;

	for (string::size_type i = S.size() - 1; i >= 0; i--)
	{
		cout << S[i];
	}

	cout << endl;

	return 0;
}

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

char str[20];
int i,len;
int main(){
	gets(str);
	len = strlen(str);
	for(i=len-1;i>=0;i--){
		printf("%c",str[i]);
	}
}

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

using namespace std;
// cin >>
// cin <<
int main(){
	string a;
	int output;
	cin >>a;
	for(int i=(int)a.size();i>=0;i--){
		cout <<a[i];
	}
	return 0;
}

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

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

C++: #include<bits/stdc++.h>
int main()
{
    int m,n,i,j,k,l;
    char a[400];
    while(scanf("%s",&a)==1)
    {
       strrev(a);
       printf("%s",a);
       printf("\n");
    }
    return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;
int main() {
  string s;
  cin >> s;
  while(!s.empty()) {
	cout << s.back();
	s.pop_back();
  }
  cout << endl;
  return 0;
}

C++: #include <iostream>
#include <string>
#include <map>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <complex>
#define rep(i, b) for(int i = 0; i < (b); i++)
#define repi(i, a, b) for(int i = (a); i < (b); i++)
#define repd(i, a, b) for(int i = (a); i >= (b); i--)
#define ALL(u) (u).begin(), (u).end()
#define INF 100000000

using namespace std;
typedef long long ll;

int main(){
	string s;
	cin >> s;
	reverse(ALL(s));
	cout << s;
	return 0;
}

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

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

	return 0;
}

C++: #include <stdio.h>

int main() {
    const int MAX = 20;
    char input[MAX];
    for (int i = 0; i < MAX; ++i) {
        input[i] = 0;
    }
    char result[MAX];
    for (int i = 0; i < MAX; ++i) {
        result[i] = 0;
    }

    scanf("%s", &input);
    int counts = 0;
    {
        int offset = 0;
        while (input[offset] != 0) {
            counts++;
            offset++;
        }
    }

    for (int i = 0; i < counts; ++i) {
        result[counts - i - 1] = input[i];
    }

    printf(result);
    return 0;
}

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

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

typedef unsigned long long ull;
typedef long long ll;

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

using namespace std;

typedef pair<int ,int > P;


int main()
{
	string str;
	cin>>str;
	
	reverse(all(str));
	cout<<str<<endl;
	


	return 0;
}

C++: #include<iostream>
#include <string.h>
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 <bits/stdc++.h>

using namespace std;

#define REPR(i, n) for(int i = n; i >= 0; i--)

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

C++: #include <iostream>
#include<string>
using namespace std;
 
 
int main(){
    string s;
    cin>>s;
    for(int i=s.size();i--;){
        cout<<s[i];
    }cout<<endl;
}

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

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

C++: #include<stdio.h>
char s[21];
void output(char *s)
{
    if(*s=='\0')return ;
    output(s+1);
    printf("%c",*s);
}
int main()
{
    scanf("%s",s);
    output(s);
    printf("\n");
    return 0;
}

C++: #include <stdio.h>
#include<string.h>
int main(void){
  
  int i,j,n;
  i=0;
  j=0;
  char a[20],b[20];
  

      scanf("%s",a);

      n = strlen(a);

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

  printf("%s\n",b);
  return 0;
}

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

using namespace std;

int main(){
  char str[1000];

  int length;

 cin>>str;

 length=strlen(str);

 for(int n=length-1;n>=0;n--){
	cout<< str[n];
 }
cout<<"\n";



 

















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

using namespace std;

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

C++: #include <stdio.h>
int main(void){
    char s[22]={'\n'},*p;
    gets(s+1);
    for(p=s;*p;p++);
    for(p--;s<=p;p--)putchar(*p);
    return 0;
}

C++: #include <stdio.h>
#include <string.h>
 
int main(void)
{
  char str[10000] = {0};
  int cx;

  fgets(str, sizeof(str), stdin);
  cx = strlen(str);

  for (int x=cx-2; x>=0; x--) {
    putchar(str[x]);
  }
 
  return 0;
}

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

int main(){ 
    string in,buf; 
    int f=0,b;

    cin >> in;
    b = in.size()-1;

    while(b-f > 1){
        buf = in[f];
        in[f] = in[b];
        in[b] = buf[0]; 
        f++;    
        b--;    
    }

    cout << in << endl;
    return 0;
}

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

C++: #include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<numeric>
#include<algorithm>
using namespace std;
int main(){
        char s[100];
        scanf("%s",s);
//      reverse(s.begin(),s.end());
    for(int i=strlen(s);i>=0;--i){
                printf("%c",s[i]);
        }
        printf("\n");
        return 0;
}