#include <bits/stdc++.h>
using namespace std;
const int maxn = 300005;
int n, m, s[maxn];
vector<int> a[maxn];
void danhdau(int x) {
  int kq[3];
  kq[0] = 0;
  kq[1] = 0;
  for (int j = 0; j < a[x].size(); j++) kq[s[a[x][j]]]++;
  if (s[x] == 2) {
    if (kq[0] > 1)
      s[x] = 1;
    else
      s[x] = 0;
    for (int j = 0; j < a[x].size(); j++) danhdau(a[x][j]);
  } else {
    int lc = 0;
    if (kq[0] <= 1 && kq[1] <= 1) return;
    if (kq[0] > 1 && s[x] == 0) s[x] = 1, lc = 1;
    if (kq[1] > 1 && s[x] == 1) s[x] = 0, lc = 1;
    if (lc)
      for (int j = 0; j < a[x].size(); j++) danhdau(a[x][j]);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  int x, y;
  for (int i = 0; i < m; i++)
    scanf("%d%d", &x, &y), a[x].push_back(y), a[y].push_back(x);
  for (int i = 0; i < n; i++) s[i] = 2;
  for (int i = 1; i <= n; i++) {
    danhdau(i);
  }
  for (int i = 1; i <= n; i++) printf("%d", s[i]);
}
