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

}

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

int main(){

  string str,ans;
  int i;

  cin >> str;
  for(i = str.size() - 1 ; i != -1 ; i--){
    ans += str[i];
  }
  cout << ans << endl;

  return 0;
}

C++: #include<iostream>
#include<cmath>
#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=s.size();i>=0;i--){
    cout<<s[i];
  }
  cout<<endl;
    return 0;
}

C++: #include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <map>
using namespace std;

#define rep(i,n) for(int i=0;i<int(n);++i)

static const double PI=6*asin(0.5);

char t;
stack<char> qu;

int main(){
	while(cin>>t){
		qu.push(t);
	}
	while(!qu.empty()){
		cout<<qu.top();
		qu.pop();
	}
	cout<<endl;
	return 0;
}

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

using namespace std;

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

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

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

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

int main(void)
{
	int i,j=0;
	char str[20],t[20];

	scanf("%s",str);

	for(i=0;str[i]!='\0';i++)
	{
      j=i;
	}
	for(i=0;i<j;i++)
	{
		t[i]=str[i];
		str[i]=str[j];
		str[j]=t[i];
		j-=1;
	}
	printf("%s\n",str);
	return 0;
}

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

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    char s[24];
    cin.getline(s, 24);
    int n = cin.gcount()-1;
    for(int i=n-1; i>=0; --i) cout<<s[i];
    cout<<'\n';
    return 0;
}

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

C++: #include <iostream>
#include <string>
#include <stack>
#include <math.h>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <vector>

using namespace std;






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


}

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

int main()
{
    char str[21];
    cin>>str;
    for(int i=0;str[i]!='\0';)
        i++;
    for(int k=i-1;k>=0;k--)
    {
        cout<<str[k];
    }
    cout<<endl;
    return 0;
}

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

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

C++: print(input()[::-1])

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

string reverse(string s);

int main(){
    string str;

    cin >> str;

    cout << reverse(str) << endl;

    return 0;
}

string reverse(string s){
    if(s.length() == 0){
        return "";
    }
    string sub = s.substr(1);

    return reverse(sub) + s.substr(0,1);
}

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

int main( void ){
    char str[20];
    scanf( "%s",str );
    for( int i = strlen( str );i > 0;i-- )printf( "%c",str[i] );
    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 <vector>
#include <cmath>
#include <map>
#include <algorithm>

typedef long long ll;
using namespace std;

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

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
//ranker
using namespace std;

#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)

using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using pis = pair<int, string>;
using psi = pair<string, int>;
using D = double;


const int Max=10000000;
bool prime[Max];
int main(void){
  string str;

  cin >> str;

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

  cout << str << endl;
}

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

#define MAX 1000

int main(void){

	char k[20];
	int c = 0;

	scanf("%s", &k);

	for (int i = 0; k[i] != '\0'; i++){
		c++;
	}

	for (int i = c; i >= 0; i--){
		printf("%c", k[i]);
	}
	printf("\n");
	
	return 0;
}

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

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

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<ll> vecll;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;

#define REP(i, a, n) for(ll i = a; i < (ll)n; i++)
#define RREP(i, a, n) for(ll i = n-1; i >= (ll)a; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007

template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T, class ...Args> void read(T& a, Args&... args){cin >> a; read(args...);} 
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<char c = ' ',class T> void write(T a){cout << fixed << setprecision(4) << a << endl;}
template<char c = ' ',class T,class ...Args> void write(T a, Args... args){cout << fixed << setprecision(4) << a << c; write<c>(args...);}
template<class T> void warr(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}
template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ull gcd(ull a, ull b){while(true){ull k = a % b;if(k == 0)return b;a = b;b = k;}}
ull comb(ull n, ull m){ull p=1;m=min(m,n-m);for(ull i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}

int main(void)
{
    string s;
    read(s);
    reverse(s.begin(),s.end());
    write(s);
    return 0;
}