#include <bits/stdc++.h>
using namespace std;
bool debug = false;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
long long ln, lk, lm;
vector<int> mp[300105];
bool v[300105];
void dfs(int x) {
  int e = 0;
  for (int c : mp[x]) {
    if (v[x] == v[c]) e++;
  }
  if (e > 1) {
    v[x] = !v[x];
    for (int c : mp[x])
      if (v[x] == v[c]) dfs(c);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0, u, v; i < m; i++) {
    scanf("%d%d", &u, &v);
    mp[u].push_back(v);
    mp[v].push_back(u);
  }
  for (int(i) = 1; (i) <= (int)(n); (i)++) dfs(i);
  for (int(i) = 1; (i) <= (int)(n); (i)++) printf("%d", v[i]);
  return 0;
}
