SiruriPrietene

#include <bits/stdc++.h>
using namespace std;
char s1[101],s2[101];
int n,m,par1[26],impar1[26];
int par2[26],impar2[26];
int main()
{
    bool ok=true;
    cin>>s1>>s2;
    n=strlen(s1);
    m=strlen(s2);
    if(n!=m)
    {
        cout<<"NU SUNT PRIETENE";
        return 0;
    }
    for(int i=0;i<n;i+=2)
        ++par1[s1[i]-'a'];
    for(int i=1;i<n;i+=2)
        ++impar1[s1[i]-'a'];
    for(int i=0;i<m;i+=2)
        ++par2[s2[i]-'a'];
    for(int i=1;i<m;i+=2)
        ++impar2[s2[i]-'a'];
    for(int i=0;i<26&&ok;++i)
    {
        if(par1[i]&&par2[i])
            if(par1[i]!=par2[i])
                ok=false;
        if(!par1[i]&&par2[i])
            ok=false;
        if(par1[i]&&!par2[i])
            ok=false;
    }
    if(ok)
    {
        for(int i=0;i<26&&ok;++i)
        {
            if(impar1[i]&&impar2[i])
                if(impar1[i]!=impar2[i])
                    ok=false;
            if(!impar1[i]&&impar2[i])
                ok=false;
            if(impar1[i]&&!impar2[i])
                ok=false;
        }
    }
    if(!ok)
        cout<<"NU SUNT PRIETENE";
    else
        cout<<"PRIETENE";
    return 0;
}