#include <bits/stdc++.h>
using namespace std;
const int MaxN = 300010;
int N, M, u, v;
vector<int> g[MaxN];
int cnt[MaxN];
char ans[MaxN];
int main() {
  scanf("%d%d", &N, &M);
  for (int i = 1; i <= M; ++i) {
    scanf("%d%d", &u, &v);
    g[u].push_back(v);
    g[v].push_back(u);
  }
  for (int i = 1; i <= N; ++i) ans[i] = '0' + (rand() & 1);
  for (bool f = 0; !f;) {
    int cnt = 0;
    f = 1;
    for (int i = 1; i <= N; ++i) {
      cnt = 0;
      for (int j = 0; j < g[i].size(); ++j) cnt += ans[i] == ans[g[i][j]];
      if (cnt > 1) {
        ans[i] = '0' + '1' - ans[i];
        f = 0;
      }
    }
  }
  puts(ans + 1);
  return 0;
}
