#include <bits/stdc++.h>
using namespace std;
const int M = 300010;
const int mod = 1000000007;
int ans[M], n, m, x, y;
vector<int> v[M];
void dfs(int x) {
  int t = v[x].size(), cnt = 0;
  for (int i = 0; i < t; i++)
    if (ans[x] == ans[v[x][i]]) cnt++;
  if (cnt >= 2) {
    ans[x] ^= 1;
    for (int i = 0; i < t; i++)
      if (ans[x] == ans[v[x][i]]) dfs(v[x][i]);
  }
}
int main() {
  ios::sync_with_stdio(0);
  memset(ans, 0, sizeof(ans));
  cin >> n >> m;
  while (m--) {
    cin >> x >> y;
    v[x].push_back(y);
    v[y].push_back(x);
  }
  for (int i = 1; i <= n; i++) dfs(i);
  for (int i = 1; i <= n; i++) cout << ans[i];
  return 0;
}
