#include <iostream>
#include <vector>
using namespace std;

int n, m, a, b;
vector <int> e1;
vector <int> e2;
vector <int> fok(2e4 + 1, 0);
vector <int> ptn;
vector <vector <int>> g(2e4 + 1);
vector <bool> volt(6e4, false);
vector <bool> dir(6e4, false);

void del(int x) {
    swap(g[x][0], g[x].back());
    g[x].pop_back();
}

void euler(int x) {
    while (g[x].size()) {
        int i = g[x][0]; del(x);
        if (volt[i]) continue;
        volt[i] = true;
        dir[i] = (e1[i] == x);
        euler((e1[i] == x ? e2[i] : e1[i]));
    }
}

int main()
{
    cin >> n >> m;
    e1.resize(m); e2.resize(m);
    for (int i = 0; i < m; i++) {
        cin >> e1[i] >> e2[i];
        fok[e1[i]]++;
        fok[e2[i]]++;
    }
    for (int i = 1; i <= n; i++) if (fok[i] % 2) ptn.push_back(i);
    for (int i = 0; i < ptn.size(); i += 2) {
        e1.push_back(ptn[i]);
        e2.push_back(ptn[i + 1]);
    }
    for (int i = 0; i < e1.size(); i++) {
        g[e1[i]].push_back(i);
        g[e2[i]].push_back(i);
    }
    for (int i = 1; i <= n; i++) euler(i);
    cout << ptn.size() << endl;
    for (int i = 0; i < m; i++) cout << (dir[i] ? "-> " : "<- ");
}