B-Palindromic SuperSequences

////////////////          PRANTA KUMER PANDIT            ///////////////
//                      Test Case Less Template                       ||
//                                                                    ||
//                                                                    ||
//      BANGLADESH  UNIVERSITY OF BUSINESS AND TECHNOLOGY             ||
//                          INTAKE 52                                 ||
//                      DEPARTMENT OF CSE                             ||
//                                                                    ||
//||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
//                      So, WELCOME TO ISHAN'S PERADISE           //
//                (-.-) Want to be a Secret tool of next ICPC��(-.-)����//
 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb   push_back
#define yes   cout<<"YES"<<endl
#define no   cout<<"NO"<<endl
#define all(x) (x).begin(), (x).end()
#define    gcd(a,b)      __gcd(a,b)
#define    lcm(a,b)  (a*b)/__gcd(a,b)
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
void  solve()
{
    string n;
    cin >> n;
   string rn=n;
   reverse(rn.begin(),rn.end());
   cout<< n + rn << "\n";
}
 
int main()
{
    optimize();
//int lol;
    //  cin >> lol;
    //while (lol--) {
    solve();
    // }
    return 0;
}
//                                   THANKS������������   ��������������//