#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
vector<int> adj[N];
int d[N];
bool mk[N];
unordered_set<int> bad;
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  int u, v;
  for (int i = 1; i <= m; i++) {
    scanf("%d %d", &u, &v);
    adj[u].push_back(v);
    adj[v].push_back(u);
    d[u]++;
    d[v]++;
    if (d[u] > 1) bad.insert(u);
    if (d[v] > 1) bad.insert(v);
  }
  while (!bad.empty()) {
    int p = *bad.begin();
    bad.erase(bad.begin());
    if (d[p] > 1) {
      for (int v : adj[p]) {
        if (mk[v] != mk[p]) {
          d[p]++;
          d[v]++;
        } else {
          d[p]--;
          d[v]--;
        }
        if (d[v] > 1) bad.insert(v);
      }
      mk[p] = 1 - mk[p];
    }
  }
  for (int i = 1; i <= n; i++) printf("%d", mk[i]);
  return 0;
}
