#include <bits/stdc++.h>
using namespace std;
const long long oo = 1e9;
const int LM = 3e5 + 5;
bool color[LM];
vector<int> adj[LM];
int N, M;
class dima {
  void dfs(int node) {
    int cnt = 0;
    for (int i = 0; i < (int)(adj[node].size()); ++i)
      cnt += color[node] == color[adj[node][i]];
    if (cnt >= 2) {
      color[node] = !color[node];
      for (int i = 0; i < (int)(adj[node].size()); ++i)
        if (color[node] == color[adj[node][i]]) dfs(adj[node][i]);
    }
  }

 public:
  void solve() {
    memset(color, 0, sizeof color);
    cin >> N >> M;
    for (int i = 0; i < (int)(M); ++i) {
      int A, B;
      cin >> A >> B;
      A -= 1, B -= 1;
      adj[A].push_back(B), adj[B].push_back(A);
    }
    for (int i = 0; i < (int)(N); ++i) dfs(i);
    for (int i = 0; i < (int)(N); ++i) cout << color[i];
    cout << endl;
  }
};
int main() {
  ios::sync_with_stdio(false);
  dima obj;
  obj.solve();
}
