#include <bits/stdc++.h>
using namespace std;
int N, M;
bool g[300005];
vector<int> Son[300005];
void tow_SAT(int x) {
  int enemy = 0;
  for (int i = 0; i < Son[x].size(); i++)
    if (g[x] == g[Son[x][i]]) enemy++;
  if (enemy > 1) {
    g[x] = !g[x];
    for (int i = 0; i < Son[x].size(); i++)
      if (g[x] == g[Son[x][i]]) tow_SAT(Son[x][i]);
  }
}
int main() {
  scanf("%d%d", &N, &M);
  for (int i = 1; i <= M; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    Son[x].push_back(y);
    Son[y].push_back(x);
  }
  for (int i = 1; i <= N; i++) tow_SAT(i);
  for (int i = 1; i <= N; i++) printf("%d", g[i]);
  return 0;
}
