#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
vector<int> e[N];
int f[N];
void dfs(int x) {
  int cnt = 0;
  for (vector<int>::iterator it = e[x].begin(); it != e[x].end(); it++)
    if (f[*it] == f[x]) cnt++;
  if (cnt > 1) {
    f[x] ^= 1;
    for (vector<int>::iterator it = e[x].begin(); it != e[x].end(); it++)
      if (f[*it] == f[x]) dfs(*it);
  }
}
int main() {
  int n, m, x, y;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    scanf("%d%d", &x, &y);
    e[x].push_back(y);
    e[y].push_back(x);
  }
  memset(f, 0, sizeof(f));
  for (int i = 1; i < n + 1; i++) dfs(i);
  for (int i = 1; i < n + 1; i++) printf("%d", f[i]);
  puts("");
  return 0;
}
