#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 29;
vector<int> e[300010];
int cnt[300010], ans[300010];
set<int> S;
int main() {
  int n, m, x, y;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    scanf("%d%d", &x, &y);
    e[x].push_back(y);
    e[y].push_back(x);
    cnt[x]++;
    cnt[y]++;
  }
  for (int i = 1; i <= n; i++) {
    if (cnt[i] >= 2) S.insert(i);
    ans[i] = 0;
  }
  while (!S.empty()) {
    int t = *S.begin();
    ans[t] ^= 1;
    for (int i = 0; i < (int)e[t].size(); i++) {
      int v = e[t][i];
      if (ans[v] == ans[t]) {
        cnt[v]++, cnt[t]++;
        if (cnt[v] >= 2) S.insert(v);
      } else {
        cnt[v]--;
        cnt[t]--;
        if (cnt[v] == 1) S.erase(v);
      }
    }
    S.erase(t);
  }
  for (int i = 1; i <= n; i++) printf("%d", ans[i]);
}
