#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const int INF = (int)(1e9 + 1e6);
const long long LINF = (long long)(4e18);
const double EPS = 1e-9;
const long long mod = 1e9 + 7;
mt19937 ggen;
void solve();
int main() {
  iostream::sync_with_stdio(false);
  cin.tie(0);
  ggen = mt19937(1337);
  solve();
}
void solve() {
  int n, m;
  cin >> n >> m;
  vector<pair<int, int> > a(m);
  for (int i = 0; i < m; ++i) {
    cin >> a[i].first >> a[i].second;
    a[i].first--;
    a[i].second--;
  }
  long long an1 = 0, an2 = 0;
  for (int i = 0; i < m; ++i) {
    long long r = 0, l = 0;
    for (int j = a[i].first; j <= a[i].second; ++j) {
      if (j % 2) {
        r++;
      } else
        l++;
    }
    an1 += r * l;
  }
  for (int i = 0; i < m; ++i) {
    long long r = 0, l = 0;
    for (int j = a[i].first; j <= a[i].second; ++j) {
      if (j % 2 == 0) {
        r++;
      } else
        l++;
    }
    an2 += r * l;
  }
  if (an1 > an2) {
    for (int i = 0; i < n; ++i) {
      cout << i % 2;
    }
  } else {
    for (int i = 0; i < n; ++i) {
      cout << (i % 2 == 0 ? 1 : 0);
    }
  }
}
