#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
int n, m;
int ans[N], num[N];
vector<int> nxt[N];
queue<int> q;
int main() {
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    nxt[x].push_back(y), nxt[y].push_back(x);
    ++num[x], ++num[y];
  }
  for (int i = 1; i <= n; i++)
    if (num[i] > 1) q.push(i);
  while (q.size()) {
    int x = q.front();
    q.pop();
    if (num[x] <= 1) continue;
    ans[x] ^= 1;
    num[x] = 0;
    for (int i = 0; i < nxt[x].size(); i++) {
      int y = nxt[x][i];
      if (ans[x] == ans[y])
        ++num[x], ++num[y];
      else
        --num[y];
      if (num[y] > 1) q.push(y);
    }
  }
  for (int i = 1; i <= n; i++) printf("%d", ans[i]);
  puts("");
  return 0;
}
