#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e10;
template <typename T>
void cmax(T &a, T b) {
  a = max(a, b);
}
template <typename T>
void cmin(T &a, T b) {
  a = min(a, b);
}
signed main() {
  long long n, m;
  cin >> n >> m;
  vector<pair<long long, long long>> p(m);
  for (long long i = 0; i < (m); i++) {
    long long l, r;
    cin >> l >> r;
    l--;
    r--;
    p[i] = make_pair(l, r);
  }
  vector<long long> used(n, 0);
  sort((p).begin(), (p).end());
  for (long long i = 0; i < (m); i++) {
    long long left = p[i].first;
    long long right = p[i].second;
    long long tmp = 1;
    for (long long i = left; i <= right; i++) {
      if (used[i] == 0) {
        used[i] = tmp;
        tmp *= -1;
      } else {
        tmp = used[i];
        tmp *= -1;
      }
    }
  }
  for (long long i = 0; i < (n); i++) {
    if (used[i] == 0 || used[i] == -1)
      cout << '0';
    else
      cout << '1';
  }
  cout << endl;
  return 0;
}
