Taco Winner Determination

You are given a game scenario called Taco where there are n elements in an array and in each move, exactly k elements are removed. Two players, Ben and Susan, take turns in removing the elements. The key rule is as follows:

If $$ n \mod k = 0 $$ then Susan, the second player, wins because she will make the final removal. Otherwise, Ben wins.

Your task is to determine the winner given the values of n, k and the array. Note that although the array is provided as part of the input, the values in the array do not affect the outcome; only the value of n (the number of elements) and k matter.

inputFormat

The input is given from standard input (stdin) and includes two lines:

1. The first line contains two integers n and k separated by a space.
2. The second line contains n integer values representing the elements of the array.

Note that even though the array is provided, the decision is based only on the values of n and k.

outputFormat

Print a single line to standard output (stdout):

• If $$ n \mod k = 0 $$, print Susan.
• Otherwise, print Ben.

5 2
1 2 3 4 5

Ben