Help me in solving ARRRCRT problem

My issue

can t undestand the question

My code

# cook your dish here

Problem Link: Array Recreate Practice Coding Problem - CodeChef

Chef has an array A made out of the first N natural numbers, but those are in an unknown order.

You are allowed to ask Chef for subarraies from i to j, where 1 <= i <= j<= N. But chef will tell you the numbers of the subarray in an order possibly different from the original array.

You are asked to known the minimum number of questions required to recreate the original array A.

Say N = 5

You ask from i=1 and j=3
[2,3,5]

i= 2 to j =4
[3,4,2]

i= 3 to j = 5
[1,2,4]

Hence
A = [5, 3, 2, 4, 1]

You could’ve asked chef the index one by one, but that would’ve taken 5 questions.

Your task is to determine the minimal number of questions possible to recreate A, and outpot that number.

Input:
1
5

Output
3