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 <cstdio>
#include <cstring>
#define LOOP(index,times) for(int index=0;index<times;index++)
using namespace std;

int main(){

char str[20];
scanf("%s",str);

LOOP(i,strlen(str))
	printf("%c",str[strlen(str)-i]);
printf("%c\n",str[0]);

return 0;		
}

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

using namespace std;

int main(void)
{
	string a;
	cin>>a;
	for(int i=0;i<a.size()/2;i++){
		char tmp=a.at(i);
		a.at(i)=a.at(a.size()-i-1);
		a.at(a.size()-i-1)=tmp;
	}
	cout<<a<<endl;
}

C++: #include <cstdio>
#include <cstring>
using namespace std;
int main() {
  char str[20];
  scanf("%s", str);
  int len = strlen(str);
  for (int i = len-1; i >= 0; i--) {
    printf("%c", str[i]);
  }
  printf("\n");
  return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;
int main() {
  string s;
  while(getline(cin, s)) {
    // reverse(s.begin(), s.end());
    vector<int> v;
    v.push_back(3);
    std::reverse(v.begin(), v.end());
    cout << s << endl;
  }
  return 0;
}

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

	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <cstdio>
#include <map>
#include <string>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)

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

C++: #include <iostream>
#include <string>
using namespace std;
int main() {
  string s;
  while(getline(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 = 1; i < s.length(); i++){
		cout << s[s.length() - i];
	}
	cout << endl;
	return 0;
}

C++: #include <iostream>
#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(void)
{
  string str;

  cin >> str;

  for (auto itr = end(str); itr-- != begin(str);) cout << *itr;
  cout << endl;

  return 0;
}

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

using namespace std;

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

	reverse(s.begin(), s.end());
	cout << s << endl;


}

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)
	{
		std::string::iterator it = std::prev(end(str), i);
		str_ans += *it;
	}
	return str_ans;
}

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

int main(){
    std::string str;
    std::queue<char> que;
    std::cin >> str;
    const int size = str.size();
    for(int i = 0; i < size; ++i){
        que.push(str.back());
        str.pop_back();
    }
    for(int i = 0; i < size; ++i){
        std::cout << que.front();
        que.pop();
    }
    return 0;
}

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

C++: #include <bits/stdc++.h>
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 <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;

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

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

using namespace std;

void main()
{
	char k[100];
	scanf("%s",k);
	reverse(k,k+strlen(k));
	printf("%s",k);
}

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

using namespace std;

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

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define REP0(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define ALL(c) (c).begin(),(c).end()
int main(){
	string s;
	cin >> s;
	reverse(ALL(s));
	cout << s << endl;
	return 0;
}

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

int main()
{
	string x;
	cin >> x;
	for(int i=x.length()-1;i>=0;i--)
		cout << x[i];
}

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

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

  for(int i = strlen(str); i > 0 ; i--)
    cout << *(str + i - 1);
  cout << '\n';

  return 0;
}

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

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

  return 0;
}

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

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

C++: #include <iostream>
#include <string>
#include <map>
#include <vector>
#include <set>
#include <iomanip>
#include <fstream>
#include <stdint.h>
#include <cmath>
#include <algorithm>
#include <utility>
#include <numeric>
using namespace std;

constexpr int INF       = 1000000000;/* 1e+9a */
constexpr int MODULO    = 1000000007;

#define REP(i,f,n) for(int i=(f); i < (n); ++i)
#define PER(i,f,n) for(int i=(n-1); i >= f; --i)

//----------------------------------
//----------------------------------

signed main()
{
    ios::sync_with_stdio(false);
	string s;
	cin >> s;
	PER(i, 0, s.size())
		cout << s[i] << endl;
}

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

using namespace std;

int gcd( int, int );

int main()
{
	char str[21];

	scanf("%s", str );
	
	vector<char> v( str, str + strlen( str ) );
	reverse( v.begin(), v.end() );

	for ( unsigned int i = 0; i < v.size(); i++ )
	{
		printf("%c", v[i] );
	}

	return 0;
}

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

using namespace std;

////Nayeem Shahriar Joy,Applied Physics &Electronic Engineering,University of Rajshahi.

int main()

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

C++: #include<iostream>
#include<string.h>
using namespace std;
int main(){
	char bun[25] = {};
	int len;
	cin >> bun;
	len=strlen(bun);
	for(int i=len-1;i>0;i--){
		cout<<bun[i];
	}
	cout<<endl;
	return 0;
}