#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include<algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };


string C;
void input(void) {
	CI C;
	return;
}


int main(void) {
	input();
	reverse(C.begin(), C.end());
	
	CO C E

	return 0;
}
  #include <iostream>
#include <string>
using namespace std;
int main(){
	string str;
	int i,j;
	cin >> str;
	string st="";
	for( i=str.size()-1; i>=0 ; i-- )
		st+=str[i] ;
	cout << st << endl;
}