#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-8;
vector<string> parse(string s, string c) {
  int len = c.length(), p = -len, np;
  vector<string> ans;
  do {
    np = s.find(c, p + len);
    ans.push_back(s.substr(p + len, np - p - len));
    p = np;
  } while (p != string::npos);
  return ans;
}
int color[300005];
vector<int> graf[300005];
void dfs(int x) {
  int n = graf[x].size();
  int same = 0;
  for (int i = 0; i < n; i++) {
    int y = graf[x][i];
    if (color[x] == color[y]) same++;
  }
  if (same >= 2) {
    color[x] = 1 - color[x];
    for (int i = 0; i < n; i++) {
      int y = graf[x][i];
      dfs(y);
    }
  }
}
int main() {
  int n, m, x, y;
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    cin >> x >> y;
    graf[x].push_back(y);
    graf[y].push_back(x);
  }
  for (int i = 1; i <= n; i++) dfs(i);
  for (int i = 1; i <= n; i++) cout << color[i];
  cout << endl;
  return 0;
}
