#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
int n, m, in[N], out[N], col[N];
vector<int> adj[N];
queue<int> q;
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int v, u;
    cin >> v >> u;
    v--, u--;
    adj[v].push_back(u);
    adj[u].push_back(v);
  }
  for (int v = 0; v < n; v++) {
    for (auto u : adj[v]) {
      if (col[u] == col[v])
        in[v]++;
      else
        out[v]++;
    }
  }
  for (int v = 0; v < n; v++)
    if (in[v] > 1) q.push(v);
  while (!q.empty()) {
    int v = q.front();
    q.pop();
    if (in[v] <= 1) continue;
    col[v] ^= 1;
    swap(in[v], out[v]);
    for (auto u : adj[v]) {
      if (col[u] == col[v])
        in[u]++, out[u]--;
      else
        in[u]--, out[u]++;
      if (in[u] > 1) q.push(u);
    }
  }
  for (int i = 0; i < n; i++) cout << col[i];
  cout << "\n";
}
