Codeforces Suffix Structures

Description

Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.

At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English letters), s and t. You need to transform word s into word t". The task looked simple to the guys because they know the suffix data structures well. Bizon Senior loves suffix automaton. By applying it once to a string, he can remove from this string any single character. Bizon Middle knows suffix array well. By applying it once to a string, he can swap any two characters of this string. The guys do not know anything about the suffix tree, but it can help them do much more.

Bizon the Champion wonders whether the "Bizons" can solve the problem. Perhaps, the solution do not require both data structures. Find out whether the guys can solve the problem and if they can, how do they do it? Can they solve it either only with use of suffix automaton or only with use of suffix array or they need both structures? Note that any structure may be used an unlimited number of times, the structures may be used in any order.

Input

The first line contains a non-empty word s. The second line contains a non-empty word t. Words s and t are different. Each word consists only of lowercase English letters. Each word contains at most 100 letters.

Output

In the single line print the answer to the problem. Print "need tree" (without the quotes) if word s cannot be transformed into word t even with use of both suffix array and suffix automaton. Print "automaton" (without the quotes) if you need only the suffix automaton to solve the problem. Print "array" (without the quotes) if you need only the suffix array to solve the problem. Print "both" (without the quotes), if you need both data structures to solve the problem.

It's guaranteed that if you can solve the problem only with use of suffix array, then it is impossible to solve it only with use of suffix automaton. This is also true for suffix automaton.

Sample Input

Input

automaton
tomat

Output

automaton

Input

array
arary

Output

array

Input

both
hot

Output

both

Input

need
tree

Output

need tree

Hint

In the third sample you can act like that: first transform "both" into "oth" by removing the first character using the suffix automaton and then make two swaps of the string using the suffix array and get "hot".

题意是给我们两个字符串，再在第一个字符串中找第二个，

给了我们两种方法，一：在第一个字符串删掉一些字符后得到第二个字符串；

二：在第一个字符串中改变一些字符的先后顺序得到字符串二；

如果只用第一种方法输出： automaton；

只用第二种输出：array

两种都用输出：both；

找不到输出：need tree

#include <iostream>
#include <stdio.h>
#include <cstring>
#include <math.h>
#include <algorithm>
using namespace std;
int main ()
{
    string s1,s2,s3;
    int a1[27],a2[27];
    int flag,ans;
    while (cin>>s1>>s2)
    {
        flag=ans=0;
        memset(a1, 0, sizeof(a1));
        memset(a2, 0, sizeof(a2));
        if(s1.size()<s2.size())
        {
           cout<<"need tree"<<endl;
           continue;
        }
        for (int i=0; i<s1.size(); i++)
        {
            a1[s1[i]-'a']++;
        }
        for (int i=0; i<s2.size(); i++)
        {
            a2[s2[i]-'a']++;
        }
        for (int i=0; i<26; i++)
        {
            if(a2[i]>a1[i])    //s1中某个字符数量不够
            {
                cout<<"need tree"<<endl;
                flag=1;
                break;
            }
            else if(a1[i]==a2[i])
            {
                ans++;
            }
        }
        if(flag)
        {
            continue;
        }
        if(ans==26)  //各个字母数量匹配，并仅有s2中的字母，因为不相同，则肯定为arry
        {
            cout<<"array"<<endl;
            continue;
        }
        ans=0;
        for (int i=0; i<s1.size(); i++)  //到这里说明s2中肯定有s1
        {
            if(s1[i]==s2[ans]) //automation判断
            {
                ans++;
            }
        }
        if(ans==s2.size())
        {
            cout<<"automaton"<<endl;
        }
        else
        {
            cout<<"both"<<endl;
        }
    }
    return 0;
}