Problem: Pari has a friend who loves palindrome numbers. A palindrome number is a number that reads the same forward or backward. For example 12321, 100001 and 1 are palindrome numbers, while 112 and 1021 are not.

Pari is trying to love them too, but only very special and gifted people can understand the beauty behind palindrome numbers. Pari loves integers with even length (i.e. the numbers with even number of digits), so she tries to see a lot of big palindrome numbers with even length (like a 2-digit 11 or 6-digit 122221), so maybe she could see something in them.

Now Pari asks you to write a program that gets a huge integer n from the input and tells what is the n-th even-length positive palindrome number?

Input

The only line of the input contains a single integer n (1 ≤ n ≤ 10100 000).

Output

Print the n-th even-length palindrome number.

Examples

Input

1


Output

11


Input

10


Output

1001

Note

The first 10 even-length palindrome numbers are 11, 22, 33, ... , 88, 99 and 1001.

Solution (in JAVA):

Solution:

import java.io.*;
import java.math.BigInteger;
import java.util.*;

/**
 *
 * @Maher Taho
 */
public class Level   {
   
       public static boolean get(String line,int k){
           char[]freq=new char[27];
           for(int i=0;i<line.length();i++){
               char c=line.charAt(i);
               //System.out.println((int)c);
               freq[(int)c-97]++;
           }
           boolean res=true;
           for(int i =0;i<27;i++){
           if(freq[i]>k){
               res=false;
               break;
           }
           }
           return res;
       }
         public static void main(String[] args){
             Scanner in = new Scanner();
            String no=in.next();
            StringBuilder build=new StringBuilder();
            build.append(no);
            StringBuilder b=new StringBuilder();
            b.append(no);
            b=b.reverse();
            build.append(b);
             System.out.println(build);
       }
     private static class Scanner
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public Scanner()
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        }
       
    } 
    private static class Stack {
    private int Size;
    Node top;
    Stack(){
    
    Size=0;
    top=null;
    }
    public int size(){
    return this.Size;
    }
    public void push(Object item){
    Node node=new Node();
    node.data=item;
    node.next=top;
    top=node;
    Size++;
    }
    public void pop(){
    if(top!=null)
        top=top.next;
    Size--;
    }
    public boolean isEmpty(){
    return top==null;
    }
    public Object getTop(){
    if(top!=null)
        return top.data;
    else
        return null;
    }
    public void display(){
    if(top!=null){
        Node temp=top;
    while(temp!=null){
        System.out.print(temp.data+" ");
        temp=temp.next;
    }
        System.out.println();
    }
    }
  private class Node {
  Object data;
  Node next;
  }  
}
}