'Suppose your team in Valorant has N players, each with the ability Ai. In one move, You can break the formation ofthe team in the form of suffix of any length ofthe array and attach itto the front: You can do the move as many times as you like Develop python code to find ifthe array can be sorted non-decreasingly, if yes then output "Attack' and the minimum number of moves required. Otherwise , print "Defend" .
Sample Input:
2 1 3
Sample Output:
Defend'