Problem: You are given a string A. Find a string B, where B is a palindrome and A is a subsequence of B.

A subsequence of a string is a string that can be derived from it by deleting some (not necessarily consecutive) characters without changing the order of the remaining characters. For example, "cotst" is a subsequence of "contest".

A palindrome is a string that reads the same forward or backward.

The length of string B should be at most 104. It is guaranteed that there always exists such string.

You do not need to find the shortest answer, the only restriction is that the length of string B should not exceed 104.

Input

First line contains a string A (1 ≤ |A| ≤ 103) consisting of lowercase Latin letters, where |A| is a length of A.

Output

Output single line containing B consisting of only lowercase Latin letters. You do not need to find the shortest answer, the only restriction is that the length of string B should not exceed 104. If there are many possible B, print any of them.

Examples

Input

aba


Output

aba

Input

ab


Output

aabaa

Note

In the first example, "aba" is a subsequence of "aba" which is a palindrome.

In the second example, "ab" is a subsequence of "aabaa" which is a palindrome.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;


public class Main {
    BufferedReader br;
    StringTokenizer in;
    PrintWriter pw;
    Random r;
    int INF = (int) 1e9;
    long LNF = (long) 1e18;
    long mod = (long) (1e9 + 7);
    int pp = 27;
    // you shall not hack!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
    //        /*\
    //       ///          /^\
    //      ///    ~~~~  (___)
    //     ///   ~~~~~~~~  \\__
    //   _/_/_  ~/ .& . \~  \\ \
    //  [____] ~|  (__)  |~/ \\/
    //  /_/\  \~|~~~~~~~~~~  /\\
    //      \   ~~~~~~~~~~ _/ \\
    //       \ _    ~~   _/\   \\
    //      /  |        /   \   \\
    //     |  /        |     \   \\
    //    /  /   ___   |      \
    //   /___|  | __|  |_______\
    //      _|  |   |  |_
    //     |____|   |____|
    //       P.S this is omnipotent Gandalf

    int solve2() throws IOException {
        BufferedReader br2 = new BufferedReader(new FileReader("input.txt"));
        int n = Integer.parseInt(br2.readLine());
        int a[] = new int[n];
        StringTokenizer in2 = new StringTokenizer(br2.readLine());
        for (int i = 0; i < n; i++) {
            a[i] = Integer.parseInt(in2.nextToken());
        }
        int ans = 0;
        for (int i = 0; i < n; i++) {
            int z = 0;
            for (int j = 0; j < i; j++) {
                if (a[j] + j > i) z++;
            }
            ans += z * a[i];
        }
        return ans;
    }

    long p[] = new long[(int) (2 * 1e5 + 1)];
    hash prefs[];
    hash preft[];

    hash getHashS(int l, int r) {
        hash ans = prefs[r + 1];
        ans.h += mod;
        ans.h -= prefs[l].h;
        ans.h %= mod;
        ans.firstp = l;
        ans.sz = r - l + 1;
        return ans;
    }

    hash getHashT(int l, int r) {
        hash ans = preft[r + 1];
        ans.h += mod;
        ans.h -= preft[l].h;
        ans.h %= mod;
        ans.firstp = l;
        ans.sz = r - l + 1;
        return ans;
    }

    class hash implements Comparable<hash> {
        long h;
        int sz;
        int firstp;

        public hash(String s) {
            firstp = 0;
            sz = s.length();
            for (int i = 0; i < sz; i++) {
                h += (s.charAt(i) * p[i]) % mod;
                h %= mod;
            }
        }

        public hash(hash z, char c) {
            firstp = z.firstp;
            sz = z.sz + 1;
            h = (z.h + (c * p[sz - 1]) % mod) % mod;
        }

        @Override
        public int compareTo(hash o) {
            if (sz != o.sz) return sz - o.sz;
            if (firstp > o.firstp) {
                return Long.compare(h, (o.h * p[firstp - o.firstp]) % mod);
            }
            return Long.compare((h * p[o.firstp - firstp]) % mod, o.h);
        }
    }

    void solve() throws IOException {
        String a = nextToken();
        pw.print(a);
        for (int i = a.length() - 1; i >= 0 ; i--) {
            pw.print(a.charAt(i));
        }
    }

    //***************************************
    class road {
        int to;

        int w;

        public road(int tto, int ww) {
            to = tto;
            w = ww;
        }
    }

    class pair {
        int a;

        int b;

        public pair(int aa, int bb) {
            a = aa;
            b = bb;
        }

    }

    Comparator<pair> bya = new Comparator<pair>() {
        @Override
        public int compare(pair o1, pair o2) {
            if (o1.a != o2.a) return Integer.compare(o1.a, o2.a);
            return Integer.compare(o1.b, o2.b);
        }
    };

    Comparator<pair> byb = new Comparator<pair>() {
        @Override
        public int compare(pair o1, pair o2) {
            if (o1.b != o2.b) return Integer.compare(o1.b, o2.b);
            return Integer.compare(o1.a, o2.a);
        }
    };
    Comparator<road> byw = new Comparator<road>() {
        @Override
        public int compare(road o1, road o2) {
            if (o1.w != o2.w) return Integer.compare(o1.w, o2.w);
            return Integer.compare(o1.to, o2.to);
        }
    };
    Comparator<road> byto = new Comparator<road>() {
        @Override
        public int compare(road o1, road o2) {
            return Integer.compare(o1.to, o2.to);
        }
    };

    class node {
        int sz;
        int val;
        //        long sum;
        node L;
        node R;
        int prior;

        public node(int val) {
            this.val = val;
            prior = r.nextInt();
            L = null;
            R = null;
            sz = 1;
//            sum = (long)val * val;
        }

        void add(int z) {
            val = val + z;
//            sum = (long)val * val;
        }
    }

    void relax(node c) {
        if (c == null) return;
        c.sz = sfsz(c.L) + sfsz(c.R) + 1;
//        c.sum = sfsum(c.L) + sfsum(c.R) + c.val * c.val;
    }

    int sfsz(node c) {
        if (c == null) return 0;
        return c.sz;
    }

    node merge(node a, node b) {
        if (a == null) return b;
        if (b == null) return a;
        if (a.prior > b.prior) {
            a.R = merge(a.R, b);
            relax(a);
            return a;
        } else {
            b.L = merge(a, b.L);
            relax(b);
            return b;
        }
    }

    pairn split(node c, int s) {
        if (c == null) return new pairn(null, null);
        if (sfsz(c.L) >= s) {
            pairn p = split(c.L, s);
            c.L = p.b;
            relax(c);
//            relax(p.a);
            return new pairn(p.a, c);
        } else {
            pairn p = split(c.R, s - sfsz(c.L) - 1);
            c.R = p.a;
            relax(c);
//            relax(p.b);
            return new pairn(c, p.b);
        }
    }

    class pairn {
        node a;
        node b;

        public pairn(node a, node b) {
            this.a = a;
            this.b = b;
        }

    }

    String nextToken() throws IOException {
        while (in == null || !in.hasMoreTokens()) {
            in = new StringTokenizer(br.readLine());
        }
        return in.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    void gener() throws IOException {
        pw = new PrintWriter(new FileWriter("input.txt"));
        int n = r.nextInt(10) + 1;
        pw.println(n);
        for (int i = 0; i < n; i++) {
            pw.print(r.nextInt(n) + " ");
        }
        pw.close();
    }

    //    boolean check()
    public void run() throws IOException {
        r = new Random(5);
//        PrintWriter pp = new PrintWriter(new OutputStreamWriter(System.out));
//        for (int i = 0; i < 100; i++) {
//            gener();
        br = new BufferedReader(new InputStreamReader(System.in));
        pw = new PrintWriter(new OutputStreamWriter(System.out));
//        br = new BufferedReader(new FileReader("input.txt"));
//        pw = new PrintWriter(new FileWriter("output.txt"));
//        br = new BufferedReader(new FileReader("holidays.in"));
//        pw = new PrintWriter(new FileWriter("holidays.out"));
        solve();
//            int z = solve2();
//            if (a != z) {
//                pp.print("found");
//                pp.println();
//                pp.println(a);
//                pp.println(z);
//                pp.close();
//                return;
//            }
//            pp.print(i);
//        }
        pw.close();
    }

    public static void main(String[] args) throws IOException {
        new Main().run();
    }
}