Go: package main

import (
  "fmt"
)

func main() {
  var a string
  fmt.Scan(&a)
  for i:= len(a) -1; i>=0; i-- {
    fmt.Print(string(a[i]))
  }
  fmt.Println()
}

C++: #include <iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<queue>
#include<stack>
#include<stdio.h>
#include<vector>
#include<set>
#include<map>
#include<iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
typedef int long long ll;

using namespace std;
int main(){




return 0;
}

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

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

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

int main()
{
    while(1)
    {
      char str[20];
    cin>>str;
    strrev(str);

    cout<<str<<"\n";
    }

    return 0;
}

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

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>
using namespace std;

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

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

using namespace std;

int main(int argc, char const* argv[])
{
	std::string s;
	std::cin >> s;
	std::reverse(s.begin(),s.end());
	std::cout << s << std::endl;
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEFINE
#include "../../DEBUG.hpp"
#endif

int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  string s;
  cin >> s;
  reverse(s.begin(), s.end());
  cout << s << '\n';
  return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  char str[20];
    cin>>str;
  for(int i=20;i>0;i--)
    cout<<str[i-1];
  return 0;
}

C++: #include<iostream>
#include<string>
using namespace std;
int main(){
	string a;
	cin >> a;
	for(int i=a.length()-1; i>-1; i--){
		cout << a[i];
	}
	return 0;
}

C++: #include<iostream>
#include<cstring>
#include<cstdio>
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<iostream>
#include<array>
#include<algorithm>

int main(){
	std::array<char, 20>str;
	
	for(int i=0; i<20; ++i){
		std::cin >> str[i];
	}
	
	for(int i=str.size()-1; i>=0; --i){
		std::cout << str[i];
	}
	std::cout << std::endl;
	return 0;
}

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

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

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

C++: #include<cstdio>
#include<ctype.h>
#include<iostream>
#include <algorithm>
using namespace std;

int main(){
    int cut=1;
    char c[21]={0};
    for(int i=0;i<20;i++){
        scanf("%c",&c[i]);
        if(c[i]=='\n')break;
        cut++;
        if(1<=c[i]-'0' && 47>=c[i]-'0'){
            c[i]='\0';
            i-=1;
            cut-=1;
            }
        if(58<=c[i]-'0' && 64>=c[i]-'0'){
            c[i]='\0';
            i-=1;
            cut-=1;
            }
        if(91<=c[i]-'0' && 96>=c[i]-'0'){
            c[i]='\0';
            i-=1;
            cut-=1;
            }
        if(123<=c[i]-'0'){
            c[i]='\0';
            i-=1;
            cut-=1;
        }
    }
    for(int j=cut;j>-1;--j){
        printf("%c",c[j]);
    }
        cout <<""<<endl;
    return 0;
}

C++: #include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <numeric>

using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;

#define REP(i,n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i,a,b) for(int i = (a); i < (int)(b); ++i)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(v) ((int)v.size())

#define pb push_back
#define mp make_pair

int main(void)
{
    cin.sync_with_stdio(false);
    string str;
    while(cin >> str){
        reverse(ALL(str));
        cout << str << endl;
    }
    
    return 0;
}

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

C++: #include<iostream>
#include<string>
using namespace std;
 int main(){
	 string A ;
	 char R;
	 cin>>A;
	 cout<<A.length()<<endl;

	 for(int i =0; i<A.length()/2; i++){
		 R = A[i];
		
		 A[i]=A[A.length()-i -1] ;
		 A[A.length()-i-1]= R;
	 }

	 cout<<A;

	 return 0;


}

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

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

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

int main(void) {
  char s[100] = {0};
  int i = 0;
  gets(s);
  i = strlen(s);
  while(i >= 0)
  putchar(s[i--]);
  
  putchar('?\n');
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cassert>
using namespace std;

#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl

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

C++: #include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <cstring>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
    string a;
    cin >> a;
    for(int i = a.length()- 1; i >= 0; --i){
        cout << a[i];
    }
    cout << endl;
    return 0;
}

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

using namespace std;

typedef long long ll;

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

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
char a[21];
scanf("%s",a);
int b=strlen(a);
for(int c=b-1;c!=-1;c--)printf("%c",a[c]);
printf("\n");
}

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

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

C++: #include <bits/stdc++.h>
using namespace std;

int main(){
	string a,b;
	cin >> a;
	b = a;
	for (int i = 0;i < a.length();i++){
		b[i] = a[a.length() - i - 1];
	}
	cout << b << 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;
}

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

int main() {
	char a[25];
	char b[25];
	int i = 0;
	cin >> a;
	int length = strlen(a);
	for(int t = 0;t<=length;t++)
		b[t]=a[length-t-1];
	b[length] = a[length];
	cout << b;
	cout << endl;

	return 0;
}

C++: #include <string.h>

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