#include <bits/stdc++.h>
using namespace std;
const int INF = 0x0FFFFFFF;
const long long INFLL = 0x0FFFFFFFFFFFFFFFll;
const int MAXN = 300005;
int n, m, x, y;
vector<int> g[MAXN];
int ans[MAXN];
int getenemies(int i) {
  int c = 0;
  for (size_t j = 0; j < g[i].size(); j++)
    if (ans[g[i][j]] == ans[i]) c++;
  return c;
}
void solve(int p) {
  if (getenemies(p) > 1) {
    ans[p] = 1 - ans[p];
    for (size_t j = 0; j < g[p].size(); j++) solve(g[p][j]);
  }
}
int main() {
  cin >> n >> m;
  while (m--) {
    cin >> x >> y;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  for (int i = 1; i <= n; i++) solve(i);
  for (int i = 1; i <= n; i++) cout << ans[i];
  cout << '\n';
  return 0;
}
