#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

inline bool is_palindrome(const string& s) {
  string t = s;
  reverse(t.begin(), t.end());
  return s == t;
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  string s;
  cin >> s;
  string t = s;
  reverse(t.begin(), t.end());
  string ans = s + t;
  for (int i = 0; i <= t.size(); ++i) {
    string u = s + t.substr(i);
    if (is_palindrome(u)) ans = u;
  }
  cout << ans << '\n';
  return 0;
}