#include <iostream>
#include <cmath>
 
int divisorsSum( int x )
{
    int result = 1;
 
    int max = sqrt(x) + 1;
    for ( int d = 2; d <= max; ++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(26);
    return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y21hdGg+CgppbnQgZGl2aXNvcnNTdW0oIGludCB4ICkKewogICAgaW50IHJlc3VsdCA9IDE7CiAgICAKICAgIGludCBtYXggPSBzcXJ0KHgpICsgMTsKICAgIGZvciAoIGludCBkID0gMjsgZCA8PSBtYXg7ICsrZCApCiAgICB7CiAgICAgICAgaWYgKCB4ICUgZCA9PSAwICkKICAgICAgICB7CiAgICAgICAgICAgIHJlc3VsdCArPSBkICsgeC9kOwogICAgICAgIH0KICAgIH0KCiAgICByZXR1cm4gcmVzdWx0Owp9Cgp2b2lkIGZpbmRORnJpZW5kcyggaW50IG4gKQp7CiAgICBpbnQgZmluZGVkQ291bnQgPSAwOwogICAgZm9yICggaW50IGYgPSAwOyA7ICsrZiApCiAgICB7CiAgICAgICAgaW50IHMgPSBkaXZpc29yc1N1bSggZiApOwogICAgICAgIGlmICggKGYgPCBzKSAmJiAoZiA9PSBkaXZpc29yc1N1bSggcyApKSkKICAgICAgICB7CiAgICAgICAgICAgICsrZmluZGVkQ291bnQ7CiAgICAgICAgICAgIHN0ZDo6Y291dCA8PCBmaW5kZWRDb3VudCA8PCAiOiAoIiA8PCBmIDw8ICIsICIgPDwgcyA8PCAiKSIgPDwgc3RkOjplbmRsOwogICAgICAgICAgICAKICAgICAgICAgICAgaWYgKCBmaW5kZWRDb3VudCA+PSBuICkgYnJlYWs7CiAgICAgICAgfQogICAgfQp9CgppbnQgbWFpbigpIHsKICAgIGZpbmRORnJpZW5kcygyNik7CiAgICByZXR1cm4gMDsKfQ==