#include <bits/stdc++.h>
using namespace std;
long long int binaryserach(long long int low, long long int high,
                           long long int a[], long long int key) {
  while (low <= high) {
    long long int mid = low + (high - low + 1) / 2;
    if (a[mid] < key) {
      low = mid + 1;
    } else if (a[mid] > key) {
      high = mid - 1;
    } else {
      return mid;
    }
  }
  return -1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int n, m;
  cin >> n >> m;
  vector<long long int> v;
  for (long long int i = 0; i < n; i++) {
    if (i % 2 == 0) {
      v.push_back(0);
    } else {
      v.push_back(1);
    }
  }
  for (long long int i = 0; i < v.size(); i++) {
    cout << v[i];
  }
  cout << "\n";
  return 0;
}
