/*
> Kermit Presents...
*/

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

#define drop(x) cout<<x<<endl;return;
#define debug(arr,a,b) for(auto v:arr){cout<<v<<a;}cout<<b;
#define print(arr)  for(auto v:arr){cout<<v<<" ";}cout<<"\n";
#define all(arr)    (arr).begin(),(arr).end()
#define sz(s)       (s).size()
#define vi          vector<int>
#define endl        "\n"
#define pb      push_back
#define ins     insert
#define mp      make_pair
#define int     long long int
#define str     string

const int mod = 1e9 + 7;
const int inf = LLONG_MAX;

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

namespace A{
    void in(vector<int> &arr){
        for(auto &v:arr){
            cin>>v;
        }
    }
    vector<int> sorted(vector<int> arr){
        vector<int> sortme=arr;
        sort(all(sortme));
        return sortme;
    }
    string reversed(string s){
        return string(s.rbegin(),s.rend());
    }
};
using namespace A;

void kermit(){
    string s;
    cin>>s;
    string t="";
    int n=sz(s);
    for(int i=0;i<n;i++){
        // cout<<s.substr(i,n)<<endl;
        if( s.substr(i,n)==reversed(s.substr(i,n)) ){
            break;
        }
        t+=s[i];
    }
    reverse(all(t));
    cout<<s+t<<endl;
}

signed main(){
    // freopen("in.txt","r",stdin); freopen("out.txt","w",stdout);
    cin.tie(0)->sync_with_stdio(0);
    int T = 1;
    // cin>>T;
    while(T--){
        kermit();
    }
    return 0;
}