#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
#include <map>
const int N = 1e4;
int a[N];
int main()
{
int n;
cin >> n;
map<int,int>mp;
a[0]=1;
a[1]=1;
mp[1]=1;
for (int i = 2; i <= 30; i ++ )
{
a[i]=a[i-2]+a[i-1];
mp[a[i]]=1;
if(a[i]>n)
break;
}
for (int i = 1; i <= n; i ++ )
{
if(mp[i]==1)cout<<"O";
else
cout <<"o";
}
}
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e4;
int a[N];
int main()
{
int n;
int cnt=0;
cin >> n;
for (int i = 0; i < n; i ++ )
cin >> a[i];
sort(a,a+n);
for (int i = 1; i < n; i ++ )
{
while(a[i]<=a[i-1])
{
cnt++;
a[i]++;
}
}
cout<<cnt;
}
import java.io.*;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
private static int[] a=new int[3001];
public static void main(String[] args) {
int cnt=0;
Scanner reader=new Scanner(System.in);
int n=reader.nextInt();
for (int i = 0; i < n; i++) {
a[i]= reader.nextInt();
}
Arrays.sort(a,0,n);
for (int i = 1; i < n; i++) {
while (a[i]<=a[i-1])
{
cnt++;
a[i]++;
}
}
System.out.println(cnt);
}
}