#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const int INF = INT_MAX;
const long long LINF = LLONG_MAX;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;using vi = vector<int>;using vll = vector<ll>;
template <class T>
using ps = pair<T, T>;
template <class T>
using vec = vector<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;  // ascendent

// a = min(a,b)
template <typename T, typename S>
inline bool chmin(T& a, const S& b) {
  return (a > b ? a = b, 1 : 0);
}
template <typename T, typename S>
inline bool chmax(T& a, const S& b) {
  return (a < b ? a = b, 1 : 0);
}

ll mpow(int base, int exponent, int mod){
    if(exponent == 0) return 1;
    ll c = mpow(base, exponent/2, mod);
    c *= c;
    c %= mod;
    if(exponent % 2 == 1){
        c *= base;
        c %= mod;
    }
    return c;
}

/* 
auto push = [&](int r, int c){
    if(r < 0 || c < 0 || r >= h || c >= w) return;
    if(dist[r][c] != -1) return;
};
*/ //dfs/bfs埋め込み用

/*
class edge{
public:
    int to, weight;
    edge(int a, int b){
        to = a; weight = b;
    }
};
*/ //template of edge
/*class edge2{
public:
    int from, to, weight;
    edge2(int w, int a, int b){
        from = w; to = a; weight = b;
    }
};
bool comp(edge2 a, edge2 b){
    return a.weight < b.weight;
}
*/ //template of edge2
int main(){
  string a;
  cin >> a;
  int ln = a.size();
  for(int i = 0; i < ln+1; i++){
    //is_palindrome
    bool fl = true;
    for(int j = i; j < ln; j++){
      if(a[j] != a[ln-j+i-1]){
        fl = false;
        break;
      }
    }
    if(fl){
      cout << a;
      for(int k = i-1; k >= 0; k--) cout << a[k];
      return 0;
    }
  }
}