Circular Array Conflict Score

You are given a circular integer array A of size N.

Since the array is circular:

• The first and last elements are also considered adjacent

Conflict Definition:

A conflict occurs at index i if:

• A[i] is equal to at least one of its neighboring elements

Task:

• You must remove exactly one element from the array

• After removal, the remaining array still stays circular

• Return the minimum possible number of conflict positions in the resulting array

📥 Input Format

• A single integer array A

📤 Output Format

• A single integer representing the minimum possible conflict score

⚙️ Constraints

• 2≤N≤1000002 \le N \le 1000002≤N≤100000

• 1≤A[i]≤1000001 \le A[i] \le 1000001≤A[i]≤100000

🧪 Examples

Example 1

Input:

1 2 2 3

Output:

0

Explanation: If we remove one of the 2s, the remaining circular array has no adjacent equal elements.