Go: package main

import (
	"fmt"
)

func main() {
	var str string
	fmt.Scanf("%s", &str)
	fmt.Printf("%s\n", strReverse(str))
}

func strReverse(str string) string {
	data := []rune(str)
	result := []rune{}

	for i := len(data) - 1; i >= 0; i-- {
		result = append(result, data[i])
	}

	return string(result)
}

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

int main()
{
	char *a;
	char str[256];
	cin.getline(str,256);
	// cout << "data_size=" << data_size << endl;
	int data_size = sizeof(a) / sizeof(a[0]);
	for(int i=0;i<=data_size;i++)
		cout << str[data_size - i];
	// cout << endl;
	return 0;
}

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

char *reverse(char *s){
    int i,tmp;
    for(i=0; i<strlen(s)/2; i++){
        tmp = s[i];
        s[i] = s[strlen(s)-1-i];
        s[strlen(s)-1-i] = tmp;
    }
    return s;
}

int main(){

    char str[21];

    scanf("%s",str);
    printf("%s\n",reverse(str));

    return 0;
}

C++: #include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR(x,a,b) for(int x=a;x<b;x++)
#define REP(x,b) for(int x=0;x<b;x++)
#define FORSIZE(x,A) for(int x=0;x<A.size();x++)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define SORT(x) sort(x.begin(),x.end())
#define RSORT(x) sort(x.rbegin(),x.rend())
#define rsort(x,n) sort(x, x+n, greater<int>())
#define REV(x) reverse(x.begin(),x.end())
using namespace std;
typedef long long ll;
inline int toInt(std::string s) {int v; std::istringstream sin(s);sin>>v;return v;}
template<class T> inline std::string toString(T x) {std::ostringstream sout;sout<<x;return sout.str();}

int main( int argc, const char* argv[] )
{
    string s;
    cin >> s;
    for (int i=s.size()-1; i>=0; i--) {
        cout << s[i];
    }
    cout << endl;
    return 0;
}

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

/*
char* reverse(string s);

int main() {
	string str;
	cin >> str;
	
	val = reverse(str);
	
	cout << val << endl;
}

char* reverse(string s) {
	int size = s.length;
	char* val = new char[size];
	for(int i = 0; i < size; ++i) {
*/

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

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

int main()
{
	char str[20];
	int i;
	
	gets(str);
	
	for(i=strlen(str)-1; i>=0; i--) cout << str[i];
	
	return 0;
}

C++: #define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
using namespace std;
///////////////////library zone!!!!!!!!!!!!!!!!!!!!!!!!!!!!
typedef long long ll;
typedef long double ld;
#define all(a) (a).begin(),(a).end()
const ll Mod = 1000000007;
const ll mod = 998244353;
struct H {
	ll x, y;
	bool operator<(const H &b) const {
		if (x != b.x) return x < b.x;
		return y < b.y;
	}
	bool operator>(const H &b) const {
		if (x != b.x) return x > b.x;
		return y > b.y;
	}
	bool operator==(const H &b) const { return x == b.x&&y == b.y; }
	bool operator!=(const H &b) const { return (*this) != b; }
};
struct P {
	ll pos, cost;
	bool operator<(const P &b) const { return cost < b.cost; }
	bool operator>(const P &b) const { return cost > b.cost; }
};
struct B {
	ll to, cost;
};
struct E {
	ll from, to, cost;
	bool operator<(const E &b) const { return cost < b.cost; }
	bool operator>(const E &b) const { return cost > b.cost; }
};
template<typename T, typename U>
void chmin(T &a, U b) {
	if (a > b) a = b;
}
template<typename T, typename U>
void chmax(T &a, U b) {
	if (a < b) a = b;
}
template<typename T>
T max_0(T a) {
	if (a < 0) return 0;
	return a;
}
template<typename T>
T min_0(T a) {
	if (a > 0) return 0;
	return a;
}
ll read() {
	ll u;
	ll k = scanf("%lld", &u);
	return u;
}
ll gcd(ll i, ll j) {
	if (i > j) swap(i, j);
	if (i == 0) return j;
	return gcd(j%i, i);
}
ll mod_pow(ll x, ll n, ll p) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % p;
		x = x * x % p;
		n >>= 1;
	}
	return res;
}//x^n%p
const ll Inf = 3023372036854775807;
const int inf = 1500000000;
#define int long long
//----------------------------------------------------
signed main() {
	string s;
	cin >> s;
	for (int i = s.size() - 1; i >= 0; i--) {
		cout << s[i];
	}
	cout << endl;
}

C++: #include<stdio.h>

int main(){
    int i;
    char s[20];
    for(i=0;i<20;i++)s[i]='\0';
    scanf("%s",s);
    for(i=20-1;i>=0;i--)
        if(s[i]!='\0')printf("%c",s[i]);

    return 0;
}

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

C++: #include<iostream>
#include<cstdio>
using namespace std;
#define int long long

signed main(){
        //int a;
        //while( scanf("%lld", &a) != EOF ){}

        char str[21]={0};
        scanf("%s",str);
        for(int i=20;i>=0;i--){
                if(str[i]!=0) printf("%c",str[i]);
        }
        printf("\n");

        return 0;
}

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

int main(){
    string str;
    cin >> str;
    for(auto it=str.rbegin();it!=str.rend();++it)cout << *it;
    return 0;
}

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

void srot(char *str){
	int len, len3 = 0;
	char str2[20], work; 
	len = strlen(str);

	for(int len2 = 0; len > len2; len2++){
		str2[len2] = str[len2];
	}

	for(len3 = 0, len = len - 1; len >= len3; len--,len3++){
		work = str[len];
		str[len] = str[len3];
		str[len3] = work;
	}
}

int main(){
	char str[20];
	while (cin >> str) {
		srot(str);
		cout << str << endl;
	}
}

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

using namespace std;

int main(){
  char c[25] = {0};
  scanf("%s", c);
  for(int i = 24; i >= 0; i--)
  {
    if(c[i])
      cout << c[i];
  }


  return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <cmath>
#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 <vector>

using namespace std;

int main(void) {
        char input;
        vector<char> str(5);

        while((input = getchar()) != '\n') {
                str.insert(str.begin(), input);
        }

        for (char output : str) {
                putchar(output);
        }
        puts("");

        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<iostream>
#include<algorithm>
int main(){char c[21];std::cin>>c;std::string d(c);std::reverse(d.begin(),d.end());std::cout<<d.c_str()<<'\n';}

C++: #include<stdio.h>
#include<string.h>
 
int main(void){
  int i;
  char a[256];
  scanf("%s", a);
  for(i = strlen(a) - 1; i >= 0; i--){
    printf("%c",a[i]);
  }
  printf("\n");
  return 0;
}