import java.util.*;

public class Apples {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		int t1 = 0, t2 = 1;
		int a[];
		a = new int[n+1];
		// int t1 = 0, t2 = 1;
		// System.out.print("First " + n + " terms: ");
		for (int i = 1; i <= n; ++i) {

			a[i] = t1;
			int sum = t1 + t2;
			t1 = t2;
			t2 = sum;
		}
		int j = 1;
		for (int i = 1; i <= n; ++i) {
			if (Arrays.binarySearch(a, i) > 0)

				// if( 	i==a[j])
				System.out.print("O");
			else
				System.out.print("o");

		}
	}
}