#include <bits/stdc++.h>
using namespace std;
bool prost(long long x) {
  long long i, k = 2;
  if (x == 1) return false;
  for (i = 2; i <= sqrt(x); i++)
    if (x % i == 0) return false;
  return true;
}
long long st(long long x) {
  long long i = 2, k = 0;
  while (x % i == 0 && i <= x) {
    k++;
    i *= 2;
  }
  return i / 2;
}
long long n, k = 0, j, m, A[1000001], b[100001], p[1000001] = {0}, l, r = 97,
             x = 0, y = 0, mn = 1000001, mx = 0, ans = 0, t, h[1000001],
             h1[1000001], a = 0, i;
int main() {
  long double z;
  pair<long long, long long> dp[100001];
  string s, ss;
  set<long long> s1;
  map<long long, long long> mp;
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  A[1] = 1;
  A[2] = 1;
  for (i = 3; i <= n; i++) A[i] = A[i - 1] + A[i - 2];
  for (i = 1; i <= n; i++) {
    k = 0;
    for (j = 1; j <= n; j++) {
      if (i == A[j]) {
        k = 1;
        break;
      }
    }
    if (k == 1)
      cout << '0';
    else
      cout << 'o';
  }
}
