#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  cin >> n >> m;
  vector<pair<int, int>> times;
  for (int i = 0; i < m; i++) {
    int s, e;
    cin >> s >> e;
    times.push_back(make_pair(s, e));
  }
  sort(times.begin(), times.end(), [](pair<int, int> a, pair<int, int> b) {
    return (a.first == b.first) ? (a.second < b.second) : (a.first < b.first);
  });
  vector<int> ans(n, 0);
  for (auto t : times) {
    for (int i = t.first + 1; i <= t.second; i++) {
      ans[i - 1] = !ans[i - 2];
    }
  }
  for (auto a : ans) cout << a;
  cout << endl;
  return 0;
}
