#include <sstream>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <complex>
#include <malloc.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <bitset>
#include <list>
#include <string.h>
#include <assert.h>
#include  <time.h>
using namespace std;

#define ll long long
#define lp(i, e, n) for(ll i = e; i < n; i++)
#define IO ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define TC(ES) while (ES--)
#define fen kmosidnonuw
#define jen nrijngijerngair
#define jbw nguinerugnru
#define mx 0
//inevitability is the unavailabilty of vulnerability.
typedef int int32_t;	
typedef pair<int, int> ii;
vector<int> v;

const int maxn = 2e5 + 17;	
//989
void ontheGround(){
	string s;
	for(int i = 1; i <= 3; i++){
		cin >> s[i];
	}
	cout << s[2] << s[3] << s[1];
}
 


/* 
no thats not me.
*/
int main(){
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	IO;
	ll ES = 1;
	//cin >> ES;
	TC(ES){
		ontheGround();
	}

return mx; 
}
#include <bits/stdc++.h>
using namespace std;
long long INF = 1LL<<60;
using ll = long long;
using vll = vector<ll>;
using mll = map<ll, ll>;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
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 (b < a) { a = b; return 1; } return 0; }


void solve(std::string S){
    cout<<S.substr(1) << S[0]<<endl;
}

int main(){
    std::string S;
    std::cin >> S;
    solve(S);
    return 0;
}
