You are given a positive decimal number x.

Your task is to convert it to the "simple exponential notation".

Let x = a·10b, where 1 ≤ a < 10, then in general case the "simple exponential notation" looks like "aEb". If b equals to zero, the part "Eb" should be skipped. If a is an integer, it should be written without decimal point. Also there should not be extra zeroes in a and b.

Input

The only line contains the positive decimal number x. The length of the line will not exceed 106. Note that you are given too large number, so you can't use standard built-in data types "float", "double" and other.

Output

Print the only line — the "simple exponential notation" of the given number x.

Examples

Input

16


Output

1.6E1


Input

01.23400


Output

1.234


Input

.100


Output

1E-1


Input

100.


Output

1E2
import java.io.*;
import java.util.*;
import java.util.concurrent.TimeUnit;

public class a implements Runnable{
	
    public static void main(String[] args) {
    	try{
            new Thread(null, new a(), "process", 1<<26).start();
        }
        catch(Exception e){
            System.out.println(e);
        }
    }
	public void run() {
		FastReader scan = new FastReader();
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
		//PrintWriter out = new PrintWriter("file.out");
		Task solver = new Task();
		//int t = scan.nextInt();
		int t = 1;
		for(int i = 1; i <= t; i++) solver.solve(i, scan, out);
		out.close();
	}

	static class Task {
		static final int inf = Integer.MAX_VALUE;

		public void solve(int testNumber, FastReader sc, PrintWriter out) {
			StringBuilder sb = new StringBuilder(sc.nextLine());
			int decInd = sb.length();
			for(int i = 0; i < sb.length(); i++) {
				if(sb.charAt(i) == '.') {
					decInd = i;
				}
			}
			int low = 0, high = sb.length()-1;
			if(decInd == sb.length())
				sb.append('.');
			while(sb.charAt(low) == '0')
				low++;
			while(sb.charAt(high) == '0')
				high--;
			
			for(int i = low; i <= high; i++) {
				if(sb.charAt(i) == '.') {
					decInd = i;
				}
			}
			//System.out.println(decInd);
			StringBuilder ans = new StringBuilder("");
			int k = low;
			while(sb.charAt(k) == '0' || sb.charAt(k) == '.') {
				k++;
			}
			ans.append(sb.charAt(k));
			ans.append('.');
			for(int i = k+1; i <= high; i++) {
				if(sb.charAt(i) != '.')
					ans.append(sb.charAt(i));
			}
			int lo = 0, hi = ans.length()-1;
			while(ans.charAt(lo) == '0')
				lo++;
			while(ans.charAt(hi) == '0')
				hi--;
			
			if(ans.charAt(hi) == '.') {
				ans.deleteCharAt(hi);
				hi--;
			}
			//System.out.println(k);
			String s = "";
			if(decInd < k && decInd - k != 0)
				s = ("E" + (decInd - k));
			else if (decInd - k-1 != 0)
				s = "E" + (decInd - k-1);
			if(ans.charAt(hi) != 0)
				out.println(ans.substring(lo, hi+1) + s);
			else
				out.println(ans.substring(lo, hi) + s);
		}
	}
	static long binpow(long a, long b, long m) {
		a %= m;
		long res = 1;
		while (b > 0) {
			if ((b & 1) == 1)
				res = res * a % m;
			a = a * a % m;
			b >>= 1;
		}
		return res;
	}
	static void sort(int[] x){
		shuffle(x);
		Arrays.sort(x);
	}
	static void sort(long[] x){
		shuffle(x);
		Arrays.sort(x);
	}
	static class tup implements Comparable<tup>, Comparator<tup>{
		int a, b;
		tup(int a,int b){
			this.a=a;
			this.b=b;
		}
		public tup() {
		}
		@Override
		public int compareTo(tup o){
			return Integer.compare(b,o.b);
		}
		@Override
		public int compare(tup o1, tup o2) {
			return Integer.compare(o1.b, o2.b);
		}
		
		@Override
	    public int hashCode() {
			return Objects.hash(a, b);
	    }
 
	    @Override
	    public boolean equals(Object obj) {
	    	if (this == obj)
                return true;
	    	if (obj == null)
                return false;
	    	if (getClass() != obj.getClass())
                return false;
	    	tup other = (tup) obj;
	    	return a==other.a && b==other.b;
	    }
	    
	    @Override
	    public String toString() {
	    	return a + " " + b;
	    }
	}
	
	static void shuffle(int[] a) {
		Random get = new Random();
		for (int i = 0; i < a.length; i++) {
			int r = get.nextInt(a.length);
			int temp = a[i];
			a[i] = a[r];
			a[r] = temp;
		}
	}

	static void shuffle(long[] a) {
		Random get = new Random();
		for (int i = 0; i < a.length; i++) {
			int r = get.nextInt(a.length);
			long temp = a[i];
			a[i] = a[r];
			a[r] = temp;
		}
	}

	static class FastReader {
		BufferedReader br;
		StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		public FastReader(String s) throws FileNotFoundException {
			br = new BufferedReader(new FileReader(new File(s)));
		}

		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;
		}
	}

}