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

const int maxn=20001,maxm=500001;
vector<array<int,3>> adj[maxn];
int dir[maxm*2],cnt[maxn];

void euler(int start){
    stack<int> st;
    st.push(start);
    while(!st.empty()){
        int v=st.top();
        bool found=false;
        while(cnt[v]<(int)adj[v].size()){
            auto [to,i,d]=adj[v][cnt[v]++];
            if(dir[i]!=0) continue;
            dir[i]=d;
            found=true;
            st.push(to);
            break;
        }
        if(!found) st.pop();
    }
}

int main(){
    int n,m;cin>>n>>m;
    for(int i=0;i<m;i++){
        int a,b;cin>>a>>b;
        adj[a].pb({b,i,1});
        adj[b].pb({a,i,2});
    }
    vector<int> odds;
    for(int i=1;i<=n;i++) if(adj[i].size()&1) odds.pb(i);
    for(int i=0;i<(int)odds.size()-1;i+=2){
        adj[odds[i]].pb({odds[i+1],m+i,1});
        adj[odds[i+1]].pb({odds[i],m+i,2});
    }
    for(int v=1;v<=n;v++){
        if(cnt[v]<adj[v].size()) euler(v);
    }
    cout<<odds.size()<<'\n';
    for(int i=0;i<m;i++){
        if(dir[i]==1) cout<<"<- ";
        else cout<<"-> ";
    }
    cout<<'\n';
}