B. Suffix Structures

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 test(s)

input

automatontomat

output

automaton

input

arrayarary

output

array

input

bothhot

output

both

input

needtree

output

need tree

Note

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从s变到t，automaton可以删除字符，array可以换顺序。思路是能s找到字符数比t少，就need tree，否则如果能顺序找到t的字符则automaton，否则如果两字符长度相同就能array，否则both。

#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>#include<cstdlib>#include<cstring>using namespace std;char s1[100005],s2[100005];int num[1005];int l1,l2,i,j,k;bool both;int main(){scanf("%s%s",s1+1,s2+1);l1=strlen(s1+1);l2=strlen(s2+1);k=1;for(i=1;i<=l1&&k<=l2;++i){if(s1[i]==s2[k]){++k;}}if(k>l2){printf("automaton\n");return 0;}for(i=1;i<=l1;++i){++num[s1[i]];}for(i=1;i<=l2;++i){--num[s2[i]];}both=false;for(i=0;i<=1000;++i){if(num[i]<0){printf("need tree\n");return 0;}if(num[i]>0){both=true;}}if(both){printf("both\n");}else{printf("array\n");}return 0;}