#include <iostream>
#include <math.h>
 
int divisorsSum( int x )
{
    int result = 1;
     int sq= (int) sqrt(x)+1;
    for ( int d = 2; d <= sq; ++d )
    {
        if ( x % d == 0 )
        {
            result += d + x/d;
        }
    }
 
    return result;
}
 
void findNFriends( int n )
{
    int findedCount = 0;
    for ( int f = 0; ; ++f )
    {
        int s = divisorsSum( f );
        if ( (f < s) && (f == divisorsSum( s )))
        {
            ++findedCount;
            std::cout << findedCount << ": (" << f << ", " << s << ")" << std::endl;
 
            if ( findedCount >= n ) break;
        }
    }
}
 
int main() {
    findNFriends(14);
    return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8bWF0aC5oPgoKaW50IGRpdmlzb3JzU3VtKCBpbnQgeCApCnsKICAgIGludCByZXN1bHQgPSAxOwogICAgIGludCBzcT0gKGludCkgc3FydCh4KSsxOwogICAgZm9yICggaW50IGQgPSAyOyBkIDw9IHNxOyArK2QgKQogICAgewogICAgICAgIGlmICggeCAlIGQgPT0gMCApCiAgICAgICAgewogICAgICAgICAgICByZXN1bHQgKz0gZCArIHgvZDsKICAgICAgICB9CiAgICB9CgogICAgcmV0dXJuIHJlc3VsdDsKfQoKdm9pZCBmaW5kTkZyaWVuZHMoIGludCBuICkKewogICAgaW50IGZpbmRlZENvdW50ID0gMDsKICAgIGZvciAoIGludCBmID0gMDsgOyArK2YgKQogICAgewogICAgICAgIGludCBzID0gZGl2aXNvcnNTdW0oIGYgKTsKICAgICAgICBpZiAoIChmIDwgcykgJiYgKGYgPT0gZGl2aXNvcnNTdW0oIHMgKSkpCiAgICAgICAgewogICAgICAgICAgICArK2ZpbmRlZENvdW50OwogICAgICAgICAgICBzdGQ6OmNvdXQgPDwgZmluZGVkQ291bnQgPDwgIjogKCIgPDwgZiA8PCAiLCAiIDw8IHMgPDwgIikiIDw8IHN0ZDo6ZW5kbDsKICAgICAgICAgICAgCiAgICAgICAgICAgIGlmICggZmluZGVkQ291bnQgPj0gbiApIGJyZWFrOwogICAgICAgIH0KICAgIH0KfQoKaW50IG1haW4oKSB7CiAgICBmaW5kTkZyaWVuZHMoMTQpOwogICAgcmV0dXJuIDA7Cn0=