Problem: 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

Solution (in JAVA):

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

/**
 *
 * @author Saju
 *
 */

public class Main {

    private static int dx[] = { 1, 0, -1, 0 };
    private static int dy[] = { 0, -1, 0, 1 };

    private static final long INF = (long) Math.pow(10, 16);
    private static final int INT_INF = Integer.MAX_VALUE;
    private static final long NEG_INF = Long.MIN_VALUE;
    private static final int NEG_INT_INF = Integer.MIN_VALUE;
    private static final double EPSILON = 1e-10;

    private static final long MAX = (long) 1e12;
    
    private static final long MOD = 1000000007;

    private static final int MAXN = 300005;
    private static final int MAXA = 1000007;
    private static final int MAXLOG = 22;
    private static final double PI = Math.acos(-1);
    
	public static void main(String[] args) throws IOException {

		InputReader in = new InputReader(System.in);
//		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);

//         InputReader in = new InputReader(new FileInputStream("src/test.in"));
//         PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("src/test.out")));

		
		
/*




*/		
	
		String str = in.next();
		int n = str.length();
		StringBuilder sb = new StringBuilder();
		
		boolean nonzeroFound = false;
		boolean pointFound = false;
		for(int i = 0; i < n; i++) {
			if(str.charAt(i) != '0') {
				nonzeroFound = true;
			}
			if(str.charAt(i) == '.') {
				pointFound = true;
			}
			if(nonzeroFound) {
				sb.append(str.charAt(i));
			}
		}
		int len = sb.length();
		while(sb.charAt(len - 1) == '0' && pointFound) {
			sb.deleteCharAt(len - 1);
			len--;
		}
//		System.out.println(sb.toString());
		int point = sb.indexOf(".");
		if(point < 0) {
			if(sb.length() < 2) {
				out.println(sb.toString());
			}
			else {
				boolean allzero = true;
				len = sb.length();
				for(int i = 1; i < len; i++) {
					if(sb.charAt(i) != '0') {
						allzero = false;
					}
				}
				if(allzero) {
					out.println(sb.charAt(0) + "E" + (len - 1));
				}
				else {
					int len1 = sb.length();
					while(sb.charAt(len1 - 1) == '0') {
						sb.deleteCharAt(len1 - 1);
						len1--;
					}
					out.println(sb.charAt(0) + "." + sb.substring(1) + "E" + (len - 1));
				}
			}
		}
		else {

			String first = sb.substring(0, point);
			String last = sb.substring(point + 1);
			if(first.length() == 0) {
				int i = 0;
				while(last.charAt(i) == '0') {
					i++;
				}
				int f = last.charAt(i) - '0';
				String ex = last.substring(i + 1);
				boolean allzero = true;
				len = ex.length();
				for(int j = 0; j < len; j++) {
					if(ex.charAt(j) != '0') {
						allzero = false;
					}
				}
				if(allzero) {
//					System.out.println(f + " " + last.charAt(i));
					out.println(f + "E-" + (i + 1));
				}
				else {
					out.println(f + "." + ex + "E-" + (i + 1));
				}
				
			}
			else if(last.length() == 0) {
				if(first.length() < 2) {
					out.println(first.toString());
				}
				else {
					boolean allzero = true;
					len = first.length();
					for(int i = 1; i < len; i++) {
						if(first.charAt(i) != '0') {
							allzero = false;
						}
					}
					if(allzero) {
						out.println(first.charAt(0) + "E" + (len - 1));
					}
					else {
						sb = new StringBuilder();
						sb.append(first);
						int len1 = sb.length();
						while(sb.charAt(len1 - 1) == '0') {
							sb.deleteCharAt(len1 - 1);
							len1--;
						}
						out.println(sb.charAt(0) + "." + sb.substring(1) + "E" + (len - 1));
//						out.println(first.charAt(0) + "." + first.substring(1) + "E" + (len - 1));
					}
				}
			}
			else {
				if(first.length() == 1) {
					out.println(first + "." + last);
				}
				else {
					// 1234.1234
					len = first.length();
					out.println(first.charAt(0) + "." + first.substring(1) + "" + last +"E" + (len - 1));
				}
			}
			
			
		}
		
	
		in.close();
		out.flush();
		out.close();
		System.exit(0);
	}


	/*
	 * return the number of elements in list that are less than or equal to the val
	 */
	private static long upperBound(List<Long> list, long val) {
		int start = 0;
		int len = list.size();
		int end = len - 1;
		int mid = 0;

		while (true) {
			if (start > end) {
				break;
			}
			mid = (start + end) / 2;
			long v = list.get(mid);
			if (v == val) {
				start = mid;
				while(start < end) {
					mid = (start + end) / 2;
					if(list.get(mid) == val) {
						if(mid + 1 < len && list.get(mid + 1) == val) {
							start = mid + 1;
						}
						else {
							return mid + 1;
						}
					}
					else {
						end = mid - 1;
					}
				}
				return start + 1;
			}
			if (v > val) {
				end = mid - 1;
			} else {
				start = mid + 1;
			}
		}
		if (list.get(mid) < val) {
			return mid + 1;
		}
		return mid;
	}


	private static boolean isPalindrome(String str) {
		StringBuilder sb = new StringBuilder();
		sb.append(str);
		String str1 = sb.reverse().toString();
		return str.equals(str1);
	}

	private static String getBinaryStr(long n, int j) {
		String str = Long.toBinaryString(n);
		int k = str.length();
		for (int i = 1; i <= j - k; i++) {
			str = "0" + str;
		}

		return str;
	}
	
	private static long modInverse(long r) {
		return bigMod(r, MOD - 2, MOD);
	}
	
	private static long bigMod(long n, long k, long m) {

        long ans = 1;
        while (k > 0) {
            if ((k & 1) == 1) {
                ans = (ans * n) % m;
            }
            n = (n * n) % m;
            k >>= 1;
        }
        return ans;
    }
    
	private static long ceil(long n, long x) {
		long div = n / x;
        if(div * x != n) {
            div++;
        }
        return div;
	}
	
    private static int ceil(int n, int x) {
        int div = n / x;
        if(div * x != n) {
            div++;
        }
        return div;
    }

    
    private static int abs(int x) {
        if (x < 0) {
            return -x;
        }
        return x;
    }
    
    private static double abs(double x) {
        if (x < 0) {
            return -x;
        }
        return x;
    }

    private static long abs(long x) {
        if(x < 0) {
            return -x;
        }
        return x;
    }
    
    private static long lcm(long a, long b) {
        return (a * b) / gcd(a, b);
    }

    private static int lcm(int a, int b) {
        return (a * b) / gcd(a, b);
    }

    private static int gcd(int a, int b) {
        if (a == 0)
            return b;
        return gcd(b % a, a);
    }
    
    private static long gcd(long a, long b) {
        if (a == 0)
            return b;
        return gcd(b % a, a);
    }

    private static int log(long x, int base) {
        return (int) (Math.log(x) / Math.log(base));
    }

    private static int log(long x, long base) {
        return (int) (Math.log(x) / Math.log(base));
    }
    
    private static long min(long a, long b) {
        if (a < b) {
            return a;
        }
        return b;
    }

    private static int min(int a, int b) {
        if (a < b) {
            return a;
        }
        return b;
    }

    private static long max(long a, long b) {
        if (a < b) {
            return b;
        }
        return a;
    }

    private static int max(int a, int b) {
        if (a < b) {
            return b;
        }
        return a;
    }

    private static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        public String next() {
            try {
                while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                    tokenizer = new StringTokenizer(reader.readLine());

                }
            } catch (IOException e) {
                return null;
            }
            return tokenizer.nextToken();
        }

        public String nextLine() {
            String line = null;
            try {
                tokenizer = null;
                line = reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
            return line;
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public boolean hasNext() {
            try {
                while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                    tokenizer = new StringTokenizer(reader.readLine());
                }
            } catch (Exception e) {
                return false;
            }
            return true;
        }
        
        public int[] nextIntArr(int n) {
        	int arr[] = new int[n];
    		for(int i = 0; i < n; i++) {
    			arr[i] = nextInt();
    		}
    		return arr;
        }
        
        public long[] nextLongArr(int n) {
        	long arr[] = new long[n];
    		for(int i = 0; i < n; i++) {
    			arr[i] = nextLong();
    		}
    		return arr;
        }
        
        public int[] nextIntArr1(int n) {
        	int arr[] = new int[n + 1];
    		for(int i = 1; i <= n; i++) {
    			arr[i] = nextInt();
    		}
    		return arr;
        }
        
        public long[] nextLongArr1(int n) {
        	long arr[] = new long[n + 1];
    		for(int i = 1; i <= n; i++) {
    			arr[i] = nextLong();
    		}
    		return arr;
        }
       
        public void close() {
        	try {
        		if(reader != null) {
        			reader.close();
        		}
        	}
        	catch(Exception e) {
        		
        	}
        	
        	
        }
    }

}