Vus the Cossack has a simple graph with $n$ vertices and $m$ edges. Let $d_i$ be a degree of the $i$-th vertex. Recall that a degree of the $i$-th vertex is the number of conected edges to the $i$-th vertex.

He needs to remain not more than $\lceil \frac{n+m}{2} \rceil$ edges. Let $f_i$ be the degree of the $i$-th vertex after removing. He needs to delete them in such way so that $\lceil \frac{d_i}{2} \rceil \leq f_i$ for each $i$. In other words, the degree of each vertex should not be reduced more than twice.

Help Vus to remain the needed edges!

The first line contains two integers $n$ and $m$ ($1 \leq n \leq 10^6$, $0 \leq m \leq 10^6$) — the number of vertices and edges respectively.

Each of the next $m$ lines contains two integers $u_i$ and $v_i$ ($1 \leq u_i, v_i \leq n$) — vertices between which there is an edge.

It is guaranteed that the graph does not have loops and multiple edges.

It is possible to show that the answer always exists.

In the first line, print one integer $k$ ($0 \leq k \leq \lceil \frac{n+m}{2} \rceil$) — the number of edges which you need to remain.

In each of the next $k$ lines, print two integers $u_i$ and $v_i$ ($1 \leq u_i, v_i \leq n$) — the vertices, the edge between which, you need to remain. You can not print the same edge more than once.