#include <bits/stdc++.h>
using namespace std;
const int maxn = 3 * 1e5 + 10, maxm = (1 << 17), mod = 1e9 + 7;
const double PI = 3.14159265359;
vector<int> g[maxn];
int d[maxn];
bool r[maxn];
set<int> s;
int main() {
  ios::sync_with_stdio(0);
  int n, a, b, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    cin >> a >> b;
    a--, b--;
    g[a].push_back(b), g[b].push_back(a);
  }
  for (int i = 0; i < n; i++) {
    d[i] = g[i].size();
    if (g[i].size() > 1) s.insert(i);
  }
  while (s.size()) {
    a = *s.begin();
    s.erase(s.begin());
    r[a] = !r[a], d[a] = g[a].size() - d[a];
    for (int i = 0; i < g[a].size(); i++) {
      b = g[a][i];
      d[b] += (r[a] == r[b] ? 1 : -1);
      if (d[b] > 1)
        s.insert(b);
      else
        s.erase(b);
    }
  }
  for (int i = 0; i < n; i++) cout << r[i];
  return 0;
}
