#include <bits/stdc++.h>
using namespace std;
const long long maxN = 3e5 + 12;
const long long INF = 1e18 + 12;
const long long Inf = 1e9 + 12;
const long long mod = 1e9 + 7;
long long n, m, sz[maxN];
set<long long> s[4];
vector<long long> g[maxN];
bool mrk[maxN], mark[maxN];
void dfs(long long v) {
  for (long long i = 0; i < g[v].size(); i++) {
    long long u = g[v][i];
    if (mark[u]) continue;
    mrk[u] = 1 ^ mrk[v];
    mark[u] = true;
    dfs(u);
  }
  long long x = 0;
  for (long long i = 0; i < g[v].size(); i++) {
    if (mrk[v] == mrk[g[v][i]]) x++;
  }
  if (x > 1) mrk[v] ^= 1;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  for (long long i = 1; i <= m; i++) {
    long long x, y;
    cin >> x >> y;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  for (long long i = 1; i <= n; i++) {
    if (!mark[i]) dfs(i);
  }
  for (long long i = 1; i <= n; i++) cout << mrk[i];
}
