#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long INF64 = LLONG_MAX;
const int INF32 = 1e9;
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < v.size(); i++) os << (i ? " " : "") << v[i];
  os << '\n';
  return os;
}
template <class T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
  for (int i = 0; i < v.size(); i++) os << v[i];
  os << '\n';
  return os;
}
void solve();
void precalc();
int main() {
  precalc();
  solve();
  return 0;
}
void precalc() {}
void solve() {
  int n, m;
  cin >> n >> m;
  vector<vector<int>> g(n);
  vector<int> col(n, 0);
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  bool any = true;
  while (any) {
    any = false;
    for (int i = 0; i < n; i++) {
      int enemies = 0;
      for (int to : g[i]) enemies += col[to] == col[i];
      bool ok = enemies <= 1;
      if (!ok) {
        any = true;
        col[i] ^= 1;
      }
    }
  }
  for (int i = 0; i < n; i++) cout << col[i];
  cout << endl;
}
