#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;

bool ispalindrome(string S) {
  int N = S.size();
  for (int i = 0; i < N / 2; i++) {
    if (S[i] != S[N - 1 - i]) {
      return false;
    }
  }
  return true;
}

int main() {
  string S; cin >> S;
  for (int i = 0; i < S.size(); i++) {
    string T = S.substr(0, i);
    reverse(T.begin(), T.end());
    if (ispalindrome(S + T)) {
      cout << S + T << endl;
      return 0;
    }
  }
  return 0;
}