#include <bits/stdc++.h>
using namespace std;
const int N = 3 * 100000 + 10;
vector<int> g[N];
int n, m;
int q[N], head, tail;
int f[N];
bool ok(int x) {
  int sum = 0;
  for (int i = 0; i < g[x].size(); ++i) {
    sum += (f[g[x][i]] == f[x]);
  }
  return sum <= 1;
}
void adj(int x) {
  f[x] = 1 - f[x];
  for (int i = 0; i < g[x].size(); ++i) {
    if (!ok(f[g[x][i]])) {
      adj(g[x][i]);
    }
  }
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= m; ++i) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  bool flag = true;
  while (flag) {
    flag = false;
    for (int i = 1; i <= n; ++i) {
      if (!ok(i)) {
        flag = true;
        adj(i);
      }
    }
  }
  for (int i = 1; i <= n; ++i) {
    cout << f[i];
  }
  cout << endl;
  return 0;
}
