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.BigDecimal;
import java.math.MathContext;
import java.math.RoundingMode;
import java.util.*;

public class Template implements Runnable {

    BufferedReader in;
    PrintWriter out;
    StringTokenizer tok = new StringTokenizer("");

    void init() throws FileNotFoundException {
        try {
            in = new BufferedReader(new FileReader("input.txt"));
            out = new PrintWriter("output.txt");
        } catch (Exception e) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        }
    }

    String readString() {
        while (!tok.hasMoreTokens()) {
            try {
                tok = new StringTokenizer(in.readLine(), " :");
            } catch (Exception e) {
                return null;
            }
        }
        return tok.nextToken();
    }

    int readInt() {
        return Integer.parseInt(readString());
    }

    int[] readIntArray(int size) {
        int[] res = new int[size];
        for (int i = 0; i < size; i++) {
            res[i] = readInt();
        }
        return res;
    }

    long readLong() {
        return Long.parseLong(readString());
    }

    double readDouble() {
        return Double.parseDouble(readString());
    }

    <T> List<T>[] createGraphList(int size) {
        List<T>[] list = new List[size];
        for (int i = 0; i < size; i++) {
            list[i] = new ArrayList<>();
        }
        return list;
    }

    public static void main(String[] args) {
        new Thread(null, new Template(), "", 1l * 200 * 1024 * 1024).start();
    }

    long timeBegin, timeEnd;

    void time() {
        timeEnd = System.currentTimeMillis();
        System.err.println("Time = " + (timeEnd - timeBegin));
    }

    long memoryTotal, memoryFree;

    void memory() {
        memoryFree = Runtime.getRuntime().freeMemory();
        System.err.println("Memory = " + ((memoryTotal - memoryFree) >> 10)
                + " KB");
    }

    public void run() {
        try {
            timeBegin = System.currentTimeMillis();
            memoryTotal = Runtime.getRuntime().freeMemory();
            init();
            solve();
            out.close();
            if (System.getProperty("ONLINE_JUDGE") == null) {
                time();
                memory();
            }
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(-1);
        }
    }

    void solve() throws IOException {
        String s = readString();

        boolean hasT = s.contains(".");
        ArrayDeque<Character> deq = new ArrayDeque<>();
        for (int i = 0; i < s.length(); i++) {
            deq.addLast(s.charAt(i));
        }

        if (hasT) {
            while (deq.peekLast() == '0') deq.pollLast();
            if (deq.peekLast() == '.') {
                deq.pollLast();
                hasT = false;
            }
        }

        while (deq.size() > 0 && deq.peek() == '0') deq.pollFirst();

        if (!hasT) {
            if (deq.size() == 0) {
                deq.add('0');
            }
            if (deq.size() == 1) {
                out.println(deq.poll());
                return;
            }
            int exp = deq.size() - 1;
            out.print(deq.poll());
            while (deq.size() > 0 && deq.peekLast() == '0') deq.pollLast();
            if (deq.size() > 0) {
                out.print(".");
                while (deq.size() > 0) out.print(deq.poll());
            }

            out.println("E" + exp);
            return;
        }

        if (deq.size() == 1) {
            out.println(0);
            return;
        }

        int exp = 0;
        if (deq.peek() == '.') {
            deq.poll();
            exp = -1;
            while (deq.peek() == '0') {
                exp--;
                deq.pollFirst();
            }
            out.print(deq.poll());
            if (deq.size() > 0) {
                out.print(".");
                while (deq.size() > 0) out.print(deq.poll());
            }
            if (exp != 0) {
                out.print("E" + exp);
            }
        } else {
            ArrayDeque<Character> sec = new ArrayDeque<>();
            while (deq.peek() != '.') sec.add(deq.poll());
            deq.poll();
            exp = sec.size() - 1;
            out.print(sec.poll());
            if (sec.size() + deq.size() > 0) {
                out.print(".");
                while (sec.size() > 0) out.print(sec.poll());
                while (deq.size() > 0) out.print(deq.poll());
            }
            if (exp != 0) {
                out.print("E" + exp);
            }
        }

    }

}