2145

#include <bits/stdc++.h>

using namespace std;

int main(){

    int m,n;
    vector<int>divisoresM;
    vector<int>divisoresN;

    scanf("%d %d",&m,&n);

    while(m||n){

        bool f1 = false,f2 = false;
        int sumDivisoresM=0,sumDivisoresN=0;

        int aux;
        if(m > n){
            aux = m;
            m = n;
            n = aux;
        }

        sumDivisoresM = 1;
        divisoresM.push_back(1);
        for(int i = 2; i * i <= m; ++i){
            if(m % i == 0){
                sumDivisoresM += i;
                divisoresM.push_back(i);
                if (i * i == m) continue;
                sumDivisoresM += m / i;
                divisoresM.push_back(m / i);
            }
        }

        sumDivisoresN = 1;
        divisoresN.push_back(1);
        for(int i = 2; i * i <= n; ++i){
            if(n % i == 0){
                sumDivisoresN += i;
                divisoresN.push_back(i);
                if (i * i == n) continue;
                sumDivisoresN += n / i;
                divisoresN.push_back(n / i);
            }
        }

        for(int i=0;i<divisoresM.size();i++){
            if(sumDivisoresN==divisoresM[i]){
                f1 = true;
                break;
            }
        }
        for(int i=0;i<divisoresN.size();i++){
            if(sumDivisoresM==divisoresN[i]){
                f2 = true;
                break;
            }
        }

        if(f1 && f2){
            printf("Friends and lovers <3\n");
        }else if(sumDivisoresM==sumDivisoresN){
            printf("Almost lovers!\n");
        }else if((n%sumDivisoresM==0) && (m%sumDivisoresN!=0)){
            printf("%d friendzoned %d!\n",n,m);
        }else{
            printf("No connection.\n");
        }
        divisoresM.clear();
        divisoresN.clear();
        scanf("%d %d",&m,&n);
    }
    return 0;
}