DSA Level 2 Data Structures Graphs Minimum Number Of Swaps Required To Sort An Array

Minimum Number Of Swaps Required To Sort An Array

hard

Graphs

Question Solve Solutions

Given an array of n distinct elements, find the minimum number of swaps required to sort the array.

Input Format

First line contains an integer N . Second line has 2 space separated integers ai and bi.

Output Format

Print in one line the minimum number of swaps required to sort the given array.

Constraints

1 &lt;= n &lt;= 1000000
1 &lt;= arr[i] &lt;= 1000000000

Example

Input

5
10 19 6 3 5

Output

Satisfiability Of Equality Equation

Remove Max Number Of Edges To Keep Graph Fully Traversable

Related Questions

easy Sentence Similarity easy Redundant Connection easy Alien Dictionary medium Bellman Ford hard Negative Weight Cycle Detection medium Pepcoder And Reversing medium Pepcoding Course Schedule hard Kosaraju Algorithm hard Mother Vertex medium Minimum Cost To Connect All Cities medium Number Of Enclaves medium Zero One Matrix medium Number Of Distinct Island easy Rotting Oranges medium As Far From Land As Possible easy Shortest Bridge