//metoda 2
//ce citesc 2 cuvinte
//sa se verifice daca sunt anagrame(acela nr de litere, aceleasi litere care se repeta de acelas nr de ori)
//ex: abba = aabb

#include <iostream>
using namespace std;

int main()
{
    int n1, n2, i, ok, aux;
    char a[100], b[100], *p;
    cin>>a;
    cin>>b;
    n1=strlen(a);
    n2=strlen(b);

    if(n1 != n2)
    {
        cout << "nu sunt anagrame"<<"\n";
        return 0;
    }

    do
    {
        ok=1;
        for(p = a; p < a+n1-1; p++)
        {
            if(*p > *(p+1))
            {
                aux = *p;
                *p = *(p+1);
                *(p+1) = aux;
                ok = 0;
            }
        }
    }while(ok == 0);

    do
    {
        ok=1;
        for(p = b; p < b+n1-1; p++)
        {
            if(*p > *(p+1))
            {
                aux = *p;
                *p = *(p+1);
                *(p+1) = aux;
                ok = 0;
            }
        }
    }while(ok == 0);

    if(strcmp(a,b) == 0)
        cout<<"sunt anagrame"<<"\n";
    else
        cout<<"nu sunt anagrame"<<"\n";
    return 0;
}