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.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
import java.util.concurrent.*;

public class Main {
    //---------------------------------------------------------------------------

    static String trimStart(String s) {
        int i = 0;
        while(i < s.length() && s.charAt(i) == '0') {
            i++;
        }
        return s.substring(i);
    }

    static String trimEnd(String s) {
        int i = s.length() - 1;
        while(i >= 0 && s.charAt(i) == '0') {
            i--;
        }
        return s.substring(0, i + 1);
    }

    public static void main(String[] args) throws Exception {
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);
        //-----------------------------------------------------------------------
        String s = in.next();
        if (!s.contains(".")) {
            s += ".0";
        }
        if (s.charAt(s.length() - 1) == '.') {
            s += 0;
        }
        String[] a = s.split("\\.");
        int b = 0;
        if (a[0].length() > 0) {
            a[0] = trimStart(a[0]);
        }
        if (a[1].length() > 0) {
            a[1] = trimEnd(a[1]);
        }
        if (a[0].length() == 0 && a[1].length() == 0) {
            out.println("0");
        } else if (a[0].length() == 0) {
            int i = 0;
            b--;
            while (a[1].charAt(i) == '0') {
                b--;
                i++;
            }
            a[0] = "" + a[1].charAt(i);
            a[1] = a[1].substring(i + 1);
            out.print(a[0]);
            if (a[1].length() != 0) {
                out.print("." + a[1]);
            }
            if (b != 0) {
                out.print("E" + b);
            }
            out.println();
        } else {
            b = a[0].length() - 1;
            a[1] = a[0].substring(1) + a[1];
            a[0] = "" + a[0].charAt(0);
            a[1] = trimEnd(a[1]);
            out.print(a[0]);
            if (a[1].length() != 0) {
                out.print("." + a[1]);
            }
            if (b != 0) {
                out.print("E" + b);
            }
            out.println();
        }
        //-----------------------------------------------------------------------
        out.close();
    }

    //---------------------------------------------------------------------------
    static void shuffleArray(int[] ar) {
        Random rnd = ThreadLocalRandom.current();
        for (int i = ar.length - 1; i > 0; i--) {
            int index = rnd.nextInt(i + 1);
            int a = ar[index];
            ar[index] = ar[i];
            ar[i] = a;
        }
    }

    static class Pair<F, S> implements Comparable<Pair<F, S>> {

        F first;
        S second;

        public Pair() {

        }

        public Pair(F f, S s) {
            this.first = f;
            this.second = s;
        }

        @Override public boolean equals(Object o) {
            Pair<F, S> p = (Pair<F, S>) o;
            if (first.equals(p.first) && second.equals(p.second)) {
                return true;
            }
            return false;
        }

        public int compareTo(Pair<F, S> p) {
            int ret = ((Comparable<F>) first).compareTo(p.first);
            if (ret == 0) {
                ret = ((Comparable<S>) second).compareTo(p.second);
            }
            return ret;
        }
    }

    static class BitMask {
        private int mask;

        public BitMask() {
            mask = 0;
        }

        public BitMask(BitMask b) {
            mask = b.getMask();
        }

        public BitMask(int i) {
            mask = i;
        }

        public int getMask() {
            return mask;
        }

        public void setMask(int i) {
            mask = i;
        }

        public int get(int i) {
            return (mask >> i) & 1;
        }

        public void set(int i, int v) {
            if (v == 0) {
                mask = mask & ~(1 << i);
            } else {
                mask = mask | (1 << i);
            }
        }

        public void set(int v) {
            for (int i = 0; i < 32; i++) {
                set(i, v);
            }
        }

        public void flip(int i) {
            mask = mask ^ (1 << i);
        }

        public void flip() {
            for (int i = 0; i < 31; i++) {
                flip(i);
            }
        }

        public int count() {
            int ret = 0;
            for (int i = 0; i < 32; i++) {
                if (get(i) == 1) {
                    ret++;
                }
            }
            return ret;
        }

        public static int grayCode(int i) {
            return i ^ (i >> 1);
        }
    }

    static class InputReader {

        public BufferedReader reader;
        public StringTokenizer tokenizer;

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

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

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

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

        public char[] nextCharArray() {
            return next().toCharArray();
        }

        public boolean hasNext() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    String s = reader.readLine();
                    if (s == null) {
                        return false;
                    }
                    tokenizer = new StringTokenizer(s);
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return true;
        }

        public void skipLine() {
            try {
                tokenizer = null;
                reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
    }
}