#include <bits/stdc++.h>
using namespace std;
int n, m, x, y, f[300010], a[300010][4];
void dfs(int x) {
  int cnt = 0;
  for (int i = 1; i <= a[x][0]; i++) cnt += f[x] == f[a[x][i]];
  if (cnt > 1) {
    f[x] ^= 1;
    for (int i = 1; i <= a[x][0]; i++)
      if (f[x] == f[a[x][i]]) dfs(a[x][i]);
  }
}
int main() {
  cin >> n >> m;
  while (m--) {
    cin >> x >> y;
    a[x][++a[x][0]] = y;
    a[y][++a[y][0]] = x;
  }
  for (int i = 1; i <= n; i++) dfs(i);
  for (int i = 1; i <= n; i++) cout << f[i];
}
