#include <bits/stdc++.h>
using namespace std;
int edge[300005][5];
int num[300005], res[300005];
void dfs(int x) {
  int tmp = 0;
  for (int i = 0; i < num[x]; i++)
    if (res[x] == res[edge[x][i]]) tmp++;
  if (tmp > 1) {
    res[x] ^= 1;
    for (int i = 0; i < num[x]; i++)
      if (res[x] == res[edge[x][i]]) dfs(edge[x][i]);
  }
}
int main(int argc, char* argv[]) {
  std::ios::sync_with_stdio(false);
  int n, m, a, b;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    cin >> a >> b;
    edge[a][num[a]++] = b;
    edge[b][num[b]++] = a;
  }
  for (int i = 1; i < n + 1; i++) dfs(i);
  for (int i = 1; i < n + 1; i++) cout << res[i];
  cout << endl;
  return 0;
}
