INPUT: 5 1 2 2 1 3 OUTPUT: 2

INPUT: 5 1 2 2 1 1 OUTPUT: 1

SOLVE THIS PROBLEM IN C++

One day you wanted to read something, so you went to your bookshelf to grab some book. But when you saw how messy the bookshelf was you decided to clean it up first. 00 There are n books standing in a row on the shelf, the i-th book has color ai. You'd like to rearrange the books to make the shelf look beautiful. The shelf is considered beautiful if all books of the same color are next to each other. In one operation you can take one book from any position on the shelf and move it to the right end of the shelf. What is the minimum number of operations you need to make the shelf beautiful? Input The first line contains one integer n (l<>