#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 28;
const int mod = (int)1e9 + 7;
const double eps = 1e-8;
int n, m, k;
vector<int> vv[300010];
int vis[300010];
int main() {
  cin >> n >> m;
  int u, v;
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &u, &v);
    vv[v].push_back(u);
    vv[u].push_back(v);
  }
  bool flag = true;
  while (flag) {
    flag = false;
    for (int i = 1; i <= n; i++) {
      int cnt = 0;
      for (int v : vv[i]) {
        cnt += (vis[i] == vis[v]);
      }
      if (cnt > 1) vis[i] ^= 1, flag = true;
    }
  }
  for (int i = 1; i <= n; i++) cout << vis[i];
  return 0;
}
