#include <bits/stdc++.h>
using namespace std;
const double pi = 2 * acos(0);
unsigned long long int binpow(unsigned long long int b,
                              unsigned long long int n) {
  if (n == 0) return 1;
  if (n == 1) return b;
  if (n & 1)
    return binpow(b, n - 1) * b;
  else
    return binpow(b * b, n / 2);
}
long long int bigmod(long long int b, long long int n, long long int m) {
  if (n == 0) return 1;
  if (n % 2 == 0) {
    long long int x = bigmod(b, n / 2, m) % m;
    return (x * x) % m;
  } else
    return ((b % m) * bigmod(b, n - 1, m) % m) % m;
}
void start() {}
void solve() {
  string s;
  cin >> s;
  cout << s;
  reverse(s.begin(), s.end());
  cout << s;
}
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  start();
  solve();
  return 0;
}
