#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3 * 100 * 1000 + 5;
int enem[MAXN][3];
int cntenem[MAXN];
bool part[MAXN];
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    enem[a][cntenem[a]++] = b;
    enem[b][cntenem[b]++] = a;
  }
  for (int i = 0; i < MAXN; i++) part[i] = 0;
  for (int k = 0; k < 100; k++)
    for (int i = 1; i <= n; i++) {
      int cnt = 0;
      for (int j = 0; j < 3; j++)
        if (enem[i][j] != 0 && part[enem[i][j]]) cnt++;
      if (cnt >= 2)
        part[i] = 0;
      else
        part[i] = 1;
    }
  for (int i = 1; i <= n; i++) cout << part[i];
  cout << endl;
  return 0;
}
