Sorting is one of the most frequently performed computational tasks. Consider the special sorting problem in which the records to be sorted have at mostthree different key values. This happens for instance when we sort medalists of a competition according to medal value, that is, gold medalists come first, followed by silver, and bronze medalists come last.

In this task the possible key values are the integers 1, 2 and 3. The required sorting order is non-decreasing. However, sorting has to be accomplished by a sequence of exchange operations. An exchange operation, defined by two position numbers p and q, exchanges the elements in positions p and q.

You are given a sequence of key values. Write a program that computes the minimal number of exchange operations that are necessary to make the sequence sorted.

PROGRAM NAME: sort3

INPUT FORMAT

SAMPLE INPUT (file sort3.in)

9
2
2
1
3
3
3
2
3
1

OUTPUT FORMAT

SAMPLE OUTPUT (file sort3.out)

4

/*
ID: qhn9992
PROG: sort3
LANG: C++11
*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int a[1100],n,b[1100],dp[10][10],ans;

int main()
{
    freopen("sort3.in","r",stdin);
    freopen("sort3.out","w",stdout);
    scanf("%d",&n);
    for(int i=0;i<n;i++) scanf("%d",a+i),b[i]=a[i];
    sort(b,b+n);
    for(int i=0;i<n;i++) dp[b[i]][a[i]]++;
    ///1<--->2
    int temp;
    temp=min(dp[1][2],dp[2][1]);
    ans+=temp;
    dp[1][2]-=temp;dp[2][1]-=temp;
    ///1<--->3
    temp=min(dp[1][3],dp[3][1]);
    ans+=temp;
    dp[1][3]-=temp;dp[3][1]-=temp;
    ///2<--->3
    temp=min(dp[2][3],dp[3][2]);
    ans+=temp;
    dp[2][3]-=temp;dp[3][2]-=temp;

    ans+=(dp[1][2]+dp[1][3])*2;

    printf("%d\n",ans);
    return 0;
}

USACO Sorting a Three-Valued Sequence