#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  vector<int> c, f, nn;
  vector<int> cvr;
  c.resize(n, -1);
  cvr.resize(n, 0);
  for (int i = 0; i < m; ++i) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    f.push_back(a);
    nn.push_back(c[b]);
    c[b] = f.size() - 1;
    f.push_back(b);
    nn.push_back(c[a]);
    c[a] = f.size() - 1;
    cvr[a]++;
    cvr[b]++;
  }
  vector<set<int> > xx(4);
  for (int i = 0; i < n; ++i) xx[cvr[i]].insert(i);
  vector<int> ans(n);
  while (true) {
    int v;
    if (!xx[3].empty()) {
      v = *xx[3].begin();
    } else if (!xx[2].empty()) {
      v = *xx[2].begin();
    } else
      break;
    xx[cvr[v]].erase(v);
    int l = 0;
    for (int tt = c[v]; tt != -1; tt = nn[tt]) {
      int u = f[tt];
      xx[cvr[u]].erase(u);
      if (ans[u] == ans[v]) {
        cvr[u]--;
      } else {
        cvr[u]++;
        l += 1;
      }
      xx[cvr[u]].insert(u);
    }
    cvr[v] = l;
    ans[v] = ans[v] ^ 1;
    xx[cvr[v]].insert(v);
  }
  for (int i = 0; i < n; ++i) cout << ans[i];
  cout << endl;
  return 0;
}
