#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;
ifstream f ("nrtri.in");
ofstream g ("nrtri.out");
int v[805], n, rez=0;

int cautare_binara(int x, int st, int dr)
{
    if(st==dr)
    {
        if(v[st]>=x)
            return st;
        else return -1;
    }
    else if (dr-st==1)
    {
        if(v[st]>=x)
            return st;
        if(v[dr]>=x)
            return dr;
        else return -1;
    }
    else if(st<dr)
    {
        int mij=(st+dr)/2;
        if(v[mij]>=x)
            return mij;
        else cautare_binara(x, mij+1, dr);
    }
}

int main()
{
    f>>n;
    for(int i=0; i<n; i++)
        f>>v[i];
    sort(v, v+n);
    int i=0;
    while(i<n-2)
    {
        int j=n-1;
        while(j>i+1)
        {
            int x=v[i];
            int y=v[j];
            int poz=cautare_binara(y-x, i+1, j-1);
            cout<<"cauta "<<y-x<<" in ";
            for(int q=i+1; q<=j-1; q++)
                cout<<v[q]<<" ";
            cout<<"             "<<poz<<"\n";
            if(poz!=-1)
                rez++;
            j--;
        }
        i++;
    }
    g<<rez;
    return 0;
}