#include <bits/stdc++.h>
using namespace std;

vector<vector<array<int, 2>>> g; //hova, index
vector<bool> vis;
vector<int> ans, cnt;

void dfs(int v){
    while(cnt[v] < g[v].size()){
        if(!vis[g[v][cnt[v]][1]]){
            vis[g[v][cnt[v]][1]] = true;
            ans[g[v][cnt[v]][1]] = v;
            dfs(g[v][cnt[v]++][0]);
        }
        else cnt[v]++;
    }
}

int main() {
    int n, m;
    cin >> n >> m;
    g.resize(n + 2);
    vis.resize(m + 3 * n, false);
    ans.resize(m + 3 * n);
    cnt.resize(n + 2, 0);
    vector<array<int, 2>> e(m);
    for(int i = 0; i < m; i++){
        cin >> e[i][0] >> e[i][1];
        g[e[i][0]].push_back({e[i][1], i});
        g[e[i][1]].push_back({e[i][0], i});
    }
    int j = m;
    int szaml = 0;
    for(int i = 1; i <= n; i++){
        if(g[i].size() % 2 == 1){
            g[i].push_back({n + 1, j});
            g[n + 1].push_back({i, j++});
            szaml++;
        }
    }
    dfs(n + 1);
    for(int i = 1; i <= n; i++){
        if(cnt[i] != g[i].size()) dfs(i);
    }
    cout << szaml << "\n";
    for(int i = 0; i < m; i++){
        if(e[i][0] == ans[i]) cout << "-> ";
        else cout << "<- ";
    }
}