#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
const int N = 1e5 + 9;
int n, m, q, Q, a[N], x, y, d, ans, sum, mn, mx;
pair<int, int> p[1009];
int c[1009];
int main() {
  cin >> n >> m;
  mn = INF;
  for (int i = 0; i < m; i++) {
    cin >> x >> y;
    x--, y--;
    mn = min(mn, x);
    mx = max(mx, y);
  }
  for (int i = mn + 1; i <= mx; i += 2) {
    c[i] = 1;
    c[i - 1] = 0;
  }
  for (int i = 0; i < n; i++) cout << c[i];
  return 0;
}
