Problem Brief

Let's Play Crush Fruit Together :)

FULLTIMEOA

Breaking! 🚀🚀🔥🔥 Amazon has recently introduced an exciting new game called 🍇🍉🍊Let's Play Crush Fruit Together🍉🥝🥑! In this game, players can select any two distinct types of fruits and crush them together. Each fruit type is represented as a unique integer within an array.

Your task is to determine the minimum possible number of fruits remaining after repeatedly performing this operation. That means, as long as there exist at least two different fruit types in the array, you can keep picking and removing them.

Function Description

Complete the function getMinimumFruits in the editor.

getMinimumFruits has the following parameter(s):

int fruitsArray[n]: an array of n integers where each integer represents a specific type of fruit.

Returns The function should return a single integer, which represents the smallest number of fruits left in the array after performing the "crush operation" as many times as possible.

1Example 1

Input

fruitsArray = [3, 3, 1, 1, 2]

Output

Explanation

We can first crush fruit type 1 (e.g., banana) with fruit type 2 (e.g., pineapple). Next, we crush the remaining fruit type 1 (banana) with one fruit type 3 (orange). Now, only one fruit type 3 (orange) remains in the array. Since there are no distinct fruit types left to crush, the minimum number of remaining fruits is 1.

2Example 2

Input

fruitsArray = [1, 2, 5, 6]

Output

Explanation

We can first crush fruit type 1 with fruit type 2. Next, we can crush fruit type 5 with fruit type 6. Since all fruit types have been successfully removed through crushing, the final number of fruits left is 0.

Constraints

Limits and guarantees your solution can rely on.

1 <= n <= 10^5

1 <= fruitsArray[i] <= 10^9