#include <bits/stdc++.h>
using namespace std;
int n, m;
char res[400000], h[400000];
vector<int> v[400000];
int good(int x) {
  int r = 0;
  for (auto it : v[x]) r += (res[x] == res[it]);
  return r <= 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m;
  for (long long int i = 1; i <= m; i++) {
    int x, y;
    cin >> x >> y;
    v[x].push_back(y);
    v[y].push_back(x);
  }
  queue<int> Q;
  for (long long int i = 1; i <= n; i++) {
    if (good(i)) continue;
    Q.push(i);
    res[i] = 1 - res[i];
    while (Q.size()) {
      int x = Q.front();
      Q.pop();
      h[x] = 0;
      for (auto it : v[x])
        if (!good(it) and !h[it]) {
          h[it] = 1;
          Q.push(it);
          res[it] = 1 - res[it];
        } else if (!good(it))
          res[it] = 1 - res[it];
    }
  }
  for (long long int i = 1; i <= n; i++) res[i] += '0';
  cout << res + 1 << endl;
}
