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.PrintWriter;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class CF_688B {
	public static void main(String[] args) {
		new CF_688B().run();
	}
	
	public void run(){
		FastScanner sc = new FastScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		
		String s = sc.next();
		StringBuilder sb = new StringBuilder();
		StringBuilder sb2 = new StringBuilder(s);
		sb.append(s);
		sb.append(sb2.reverse());
		out.println(sb.toString());
		
		out.close();
	}
}


class FastScanner {
	public BufferedReader br;
	public StringTokenizer st;
	
	public FastScanner(InputStream in){
		br = new BufferedReader(new InputStreamReader(in));
		st = null;
	}
	
	public boolean hasMoreTokens(){
		while(st == null || !st.hasMoreTokens()){
			String line = null;
			try {
				line = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			if(line == null)
				return false;
			st = new StringTokenizer(line);
		}
		return true;
	}
	
	public String next(){
		if(!hasMoreTokens())
			return null;
		return st.nextToken();
	}
	
	public int nextInt(){
		return Integer.parseInt(next());
	}
	
	public long nextLong(){
		return Long.parseLong(next());
	}
	
	public int[] readIntArray(int n){
		int[] array = new int[n];
		for(int i = 0;i<n;i++){
			array[i] = nextInt();
		}
		return array;
	}
	
	public long[] readLongArray(int n){
		long[] array = new long[n];
		for(int i = 0;i<n;i++){
			array[i] = nextLong();
		}
		return array;
	}
	
	public String[] readStringArray(int n){
		String[] a = new String[n];
		for(int i = 0;i<n;i++){
			a[i] = next();
		}
		return a;
	}
}