A company is planning a meeting and has $n$ employees, labeled from $0$ to $n - 1$. Each employee has a single favorite person whom they wish to sit next to at a round table. The employees are represented by an integer array favorite of length $n$, where favorite[i] denotes the favorite employee of employee i.

An employee will attend the meeting if and only if they can sit directly adjacent to their favorite person at the round table. The round table can seat any number of employees.

Return the maximum number of employees that can be invited to the meeting.

Constraints:

• n $==$ favorite.length

• $2 \leq$ n $\leq 10^5$

• $0 \leq$ favorite[i] $\leq$ n $- 1$

• favorite[i] $\neq$ i

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.