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


int main() {

//変数の宣言

	string str;
	int i;

	cin >> str;

	for(i=0;i<str.size();i++){
		cout << str[str.size()-i-1];
	}
	
	cout <<endl;	
	
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <complex>
#include <iterator>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;

#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define tr(c, i) for(auto i = (c).begin(); i != (c).end(); i++)
#define rtr(c, i) for(auto i = (c).rbegin(); i != (c).rend(); i++)
#define repfn(i, a, cont, next) \
  for(auto i = (a); [=](){return(cont);}(); i = [=](){return(next);}())
#define repby(i, a, b, step) repfn(i, a, i < b, i + step)
#define repab(i, a, b) repby(i, (a), (b), 1)
#define rep(i, n) repab(i, 0, (n))
#define pb push_back
#define sz(c) int((c).size())

int rndup1000(int x) {
  int mod = x % 1000;
  if (mod)
    return x - mod + 1000;
  else
    return x;
}

int main(int argc, char **argv)
{
  int n;
  int debt = 100000;
  cin >> n;
  while (n--) {
    debt = rndup1000((debt/100)*105);
  }
  cout << debt << endl;
  return 0;
}

C++: #include <cstdio>
#include <cstring>
int main( void )
{
  int len;
  char s[128];
  gets( s );
  len = strlen( s );
  for( int i=len-1; i>=0; i-- ) putchar( s[i] );
  putchar( '\n' );
  return 0;
}

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

using namespace std;
main(){
	char str[20];
	int len=0;
	int i;
	scanf("%s",str);

	len=0;
	while(str[len] != '\0') {
	len++;
	}

	for(i=len-1;i>=0;i--) {
	printf("%c",str[i]);
	}
	printf("\n");
}

C++: #include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<numeric>
#include<algorithm>
using namespace std;
int main(){
        char s[100];
        scanf("%s",s);
//      reverse(s.begin(),s.end());
    for(int i=strlen(s);i>=0;--i){
                printf("%c",s[i]);
        }
        printf("\n");
        return 0;
}

C++: #include <stdio.h>

int main()
{
	int i=0,j=0,k=0,l=0;
	char str[20+10],str2[20+10];
	scanf("%s",str);
	while(str[j] != '\0')
	{
		j++;
	}
	while(k<j)
	{
		str2[k] = str[j-k-1];
		k++;
	}
	str2[k]='\0';
	printf("%s\n",str2);

}

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#define shosu(x) fixed<<setprecision(x)
using namespace std;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,P> pip;
const int inf=(1<<31)-1;

string str;

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

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

string s;

void rec(int a)
{
  if (a == -1){
    cout << '\n';
    return;
  }

  cout << s[a];
  rec(a - 1);
}

signed main(void)
{
  cin >> s;

  rec(s.size());
}

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

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<iostream>
#include<string.h>
using namespace std;
 int c[33001],n,a,b,x[33001];
int lowbit(int n)
{
    return  (-n)&n;
}
int sum(int i)
{
    int s=0;
    while (i>0)
    {
        s+=c[i];
        i-=lowbit(i);
    }
    return s;
}
void  update (int pos ,int i )
{
    while (pos<=33000)
    {
        c[pos]+=i;
        pos+=lowbit(pos);

    }
}
int main()
{

   
    cin>>n;
    memset(c,0,sizeof(c));
    memset(x,0,sizeof(x));
for(int i=1;i<=n;i++)
    {
        scanf("%d%d",&a,&b);
        x[sum(a+1)]++;
        update(a+1,1);
}
    for(int i=0;i<n;i++)
    {
        printf("%d\n",x[i]);
    }
    return 0;
}

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

using namespace std;

int main() {
    int i,len;
    string ch;

    cin >> ch;

    len = ch.length();

    for(i = 0;i < len / 2;i++){
        char box = ch[i];
        ch[i] = ch[len - i];
        ch[len - i] = box;
    }

    for(i = 0; i <= len;i++){
        cout << ch[i];
    }
    cout << endl;

    return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;
int main() {
  string s;
  cin >> s;
  while(!s.empty()) {
	cout << s.back();
	s.pop_back();
  }
  cout << endl;
  return 0;
}

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

int main()
{
char str[20];
 gets(str);
 strrev(str);
 printf("%s\n",str);
 return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
	string s;
	reverse(s.begin(),s.end());
	cout << s << endl;
	return 0;
}

C++: #include <stdio.h>


int main(void){
    char st[20+1];
    char *pt;

    scanf("%s", st);
    for (pt=st; *pt!='\0'; pt++) ;
    for (pt--; pt!=st; pt--) printf("%c", *pt);
    printf("%c", *pt);
    return 0;
}

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

int main()
{
    string s;
    cin >> s;
    reverse_iterator<std::string::iterator> r = s.rbegin();
    string rev(r, s.rend());
    cout << rev << '\n';
}

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

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

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

using namespace std;
int main() {
	string str;
	cin >> str;
	int n = str.length();
	string r_str;
	for(int i = 0; i < n; i++) {
		r_str += str.at(n - i - 1);
	}
	cout << r_str << endl;
	return 0;
}

C++: #include <iostream>
#include <string.h>
using namespace std;
int main()
{
   char str[21];
  while(cin>>str)
{
   int len=strlen(str);
   for(int i=len-1;i>=0;i--)
   cout<<str[i];
   cout<<endl;
  }
  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()-1;i>=0;i--){
			cout << s[i];
		}
		cout << endl;
	}
	return 0;
}

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

using namespace std;

int main() {
    int i,len;
    string ch;

    //while(cin >> ch){

    len = ch.length();

    for(i = 0;i < len / 2;i++){
        char box = ch[i];
        ch[i] = ch[len - i];
        ch[len - i] = box;
    }

    for(i = 0; i <= len;i++){
        cout << ch[i];
    }
    cout << endl;

    // }

    return 0;
}

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

int main(){
  char str[21];
  scanf("%s", str);
  for(int i=0; i<strlen(str); i++){
    printf("%c", str[strlen(str)-i-1]);
  }
  puts("");
  return 0;
}

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

using namespace std;

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

  int a = str.size();
  char swap;
  for(int i = 0; i < a/2; i++){
    swap = str[i];
    str[i] = str[a-i-1];
    str[a-i-1] = swap;
  }

  cout << str << endl;
}

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


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

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

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

C++: #include <iostream>
#include <string.h>
#include <algorithm>
#define ll long long
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    string s1;
    while(cin >> s1)
    {
        for(int i=s1.length()-1;i>=0;i--) cout << s1[i];
        cout << "\n";
    }
    return 0 ;
}