Go: package main

import "fmt"

func main() {
	var str string
	var result string

	fmt.Scanf("%s", &str)

	for i := len(str) - 1; i >= 0; i-- {
		result += string(str[i])
	}

	fmt.Println(result)
}

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

using namespace std;

int main() {
    string str;

    cin >> str;

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

    cout << str << endl;

    return 0;
}

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

int main(void){

  char word[25];
  int i,length;
  
  cin >> word;
  length = strlen(word);
  
  for(i = length; i >=0; i--){
   cout << word[i];
  }
  
  cout << endl;
  
  return 0;

}

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

}
}

C++: int main(){
  char buff[100];
  int n;
  scanf("%s",buff);
  for(n = strlen(buff); n;) putchar(buff[--n]);
  return 0;
}

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

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

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(); i>=0; --i){
		std::cout << str[i];
	}
	return 0;
}

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

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

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

int main(){
	char s[21];
	cin >> s;
	int len=strlen(s);

	for(int i=0;i<(len/2);i++){
		char c;
		c = s[i];
		s[i] = s[len-i-1];
		s[len-i-1] = c;
	}
	cout<<s<<"\n";
	system("pause");
return 0;
}

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

#define int				long long
#define FOR( i, m, n )  for( int (i) = (m); (i) < (n); (i)++ )
#define FORE( i, m, n ) FOR( i, m , n + 1 )
#define REP( i, n )     FOR( i, 0, n )
#define REPE( i, n )	FOR( i, 0, n + 1 )
#define REPR( i, m )	for( int (i) = (m); (i) >= 0; (i)-- )
#define REPONE( i, n )	FOR( i, 1, n + 1 )
#define ALL( a )        (a).begin(), (a).end()             
#define MP( a, b )		make_pair( (a), (b) )
#define fi				first
#define se				second

template<class T>bool chmax( T& a, const T& b ) { if( a < b ) { a = b; return 1; } return 0; }
template<class T>bool chmin( T& a, const T& b ) { if( a > b ) { a = b; return 1; } return 0; }

const int INF = 1e9;
const int MOD = 1e9 + 7;

int gcd( int a, int b ) {
	if( a % b == 0 ) return b;
	else			 gcd( b, a % b );
}

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

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

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

C++: #include<cstdio>
#include<string>
#include<algorithm>
#include<iostream>
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 str;
    cin >> str;
    int i = 0,j = str.size() - 1;
    while(i < j){
    	char tmp;
    	tmp = str[i];
    	str[i] = str[j];
    	str[j] = tmp;
    	++i;
    	--j;
    }
    cout << str << endl;
    return 0;
}

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

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

int main(){
	char str[21];
	char temp[21];
	int i = 0;

	memset(str, 0, sizeof(str));
	memset(temp, 0, sizeof(temp));

	while(cin >> str){
		int n = strlen(str);
		for(; n!=0; ){
			temp[i++] = str[--n];
		}
		cout << temp << endl;
	}
	return 0;
}

C++: #include<cstdio>
#include<cstring>

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

C++: #include<stdio.h>
#include<string.h>
int main()
{
   char arr[20];
   int i,s;
   gets(arr);
   s=strlen(arr);
   for(i=s-1;i>=0;i--)
   {
       printf("%c",arr[i]);
   }
   return 0;
}

C++: #include<iostream>
#include<queue>
#include<string>
#include<stack>
#include<cstdio>
#include<algorithm>

using namespace std;

int main(void)
{
  int l;
  string str;
  string s;

  cin>>str;

  l=str.size();

  for(int i=l-1;i>=0;i--)
    {
      cout<<str[i];
    }

  puts("");

}

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

std::string reverse_str(std::string str);

int main()
{
	std::string str;
	while (std::cin >> str)
	{
		str = reverse_str(str);
		std::cout << str << std::endl;
	}
	return 0;
}

std::string reverse_str(std::string str)
{
	std::string str_ans;
	for (unsigned long i = 1; i <= str.size(); ++i)
	{
		decltype(str)::iterator it = std::prev(end(str), i);
		str_ans += *it;
	}
	return str_ans;
}

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 <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#define ALL(v) begin(v),end(v)
#else
#define ALL(v) (v).begin(),(v).end()
#endif

using namespace std;


namespace{
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
	v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
	stringstream ss;
	ss << f;
	ss >> t;
}


#define REP(i,n) for(int i=0;i<int(n);++i)
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 1e-8


void mainmain(){
	string s;
	cin >> s;
	reverse(ALL(s));
	cout << s << endl;
	
}



}
int main() try{
	mainmain();
}
catch(...){}

C++: #include<iostream>
#include<cstring>
using namespace std;
	
int main()
{
	char str[19];
	cout<<"??????????????\????????????????????????\n";
	cin>>str[19];
	int j=strlen(str);
	j-=1;
	for(int i=j;i>=0;i--){
	cout<<str[i];
	}
	return 0;
}

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