#include <bits/stdc++.h>
using namespace std;
void solveA() {
  int n;
  scanf("%d", &n);
  int a[n];
  int su = 0;
  for (int i = 0; i < n; i++) scanf("%d", &a[i]), su += a[i];
  int an = 0;
  int m = n + 1;
  for (int i = 1; i < 6; i++) {
    if (n & 1) {
      int ss = su + i;
      if (ss % m != 1) an++;
    } else {
      int ss = su + i;
      if (ss % m != 1) an++;
    }
  }
  cout << an << endl;
}
int sol(int a) {
  if (a == 1)
    return 1;
  else if (a & 1)
    return (1 + sol(a / 2));
  else
    return sol(a / 2);
}
void solveB() {
  int n;
  scanf("%d", &n);
  int a[n];
  int f[n];
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    if (a[i] & (a[i] - 1) == 0)
      f[i] = 1;
    else
      f[i] = sol(a[i]);
  }
  sort(f, f + n);
  long long an = 0;
  long long cn = 1;
  int i = 1;
  while (i < n) {
    if (f[i - 1] == f[i]) {
      cn++;
    } else {
      an += cn * (cn - 1) / 2;
      cn = 1;
    }
    i++;
  }
  an += cn * (cn - 1) / 2;
  cout << an << endl;
}
void solveC() {
  int n;
  scanf("%d", &n);
  int a[n];
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  int m;
  int l, h;
  scanf("%d", &m);
  long long mx = 0;
  for (int i = 0; i < m; i++) {
    scanf("%d", &l), scanf("%d", &h);
    mx = max(mx, (long long)a[l - 1]);
    cout << mx << endl;
    mx += h;
  }
}
void solveD() {
  int n;
  scanf("%d", &n);
  int m = 2 * n;
  int a[m];
  for (int i = 0; i < m; i++) scanf("%d", &a[i]);
  map<int, int> make_pair;
  for (int i = 0; i < n; i++) make_pair[a[i]] += (a[i] == a[i + n]) ? 1 : 0;
  long long ans = 1;
  sort(a, a + m);
  int mo;
  scanf("%d", &mo);
  for (int i = 0; i < m; i++) {
    if (i == 0 || a[i] != a[i - 1]) {
      for (int j = i; a[j] == a[i]; j++) {
        int k = j - i + 1;
        if (k % 2 == 0 && k / 2 <= make_pair[a[i]])
          ans *= k / 2;
        else
          ans *= k;
        ans %= mo;
      }
    }
  }
  ans %= mo;
  cout << ans << endl;
}
int a[300010][4];
int f[300010];
void dfs(int x) {
  int cnt = 0;
  for (int i = 1; i <= a[x][0]; i++) cnt += f[x] == f[a[x][i]];
  if (cnt > 1) {
    f[x] ^= 1;
    for (int i = 1; i <= a[x][0]; i++)
      if (f[x] == f[a[x][i]]) dfs(a[x][i]);
  }
}
void solveE() {
  int n, m;
  scanf("%d", &n), scanf("%d", &m);
  for (int i = 0; i < m; i++) {
    int x, y;
    scanf("%d", &x), scanf("%d", &y);
    a[x][++a[x][0]] = y;
    a[y][++a[y][0]] = x;
  }
  for (int i = 1; i < n + 1; i++) dfs(i);
  for (int i = 1; i < n + 1; i++) cout << f[i];
  cout << endl;
}
int main() { solveE(); }
