#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
const double PI = acos(-1);
const double EPS = 1e-8;
vector<int> g[300000];
int ans[300000];
int main() {
  int n, m;
  while (cin >> n >> m) {
    for (int i = 0; i < (int)n; ++i) g[i].clear();
    for (int i = 0; i < (int)m; ++i) {
      int a, b;
      scanf("%d%d", &a, &b);
      a--;
      b--;
      g[a].push_back(b);
      g[b].push_back(a);
    }
    memset(ans, 0, sizeof(ans));
    queue<int> Q;
    for (int i = 0; i < (int)n; ++i) Q.push(i);
    while (!Q.empty()) {
      int u = Q.front();
      Q.pop();
      int cnt = 0;
      for (__typeof((g[u]).begin()) it = (g[u]).begin(); it != (g[u]).end();
           ++it)
        if (ans[*it] == ans[u]) cnt++;
      if (cnt >= 2) {
        ans[u] = !ans[u];
        for (__typeof((g[u]).begin()) it = (g[u]).begin(); it != (g[u]).end();
             ++it)
          Q.push(*it);
      }
    }
    for (int i = 0; i < (int)n; ++i) printf("%d", ans[i]);
    puts("");
  }
}
