Lee has a string of n pearls. In the beginning, all the pearls have no color. He plans to color the pearls to make it more fascinating. He drew his ideal pattern of the string on a paper and asks for your help.

In each operation, he selects some continuous pearls and all these pearls will be painted to their target colors. When he paints a string which has k different target colors, Lee will cost k² points.

Now, Lee wants to cost as few as possible to get his ideal string. You should tell him the minimal cost.

 

 

There are multiple test cases. Please process till EOF.

For each test case, the first line contains an integer n(1 ≤ n ≤ 5×10⁴), indicating the number of pearls. The second line contains a₁,a₂,...,a_n (1 ≤ a_i ≤ 10⁹) indicating the target color of each pearl.

 

 

For each test case, output the minimal cost in a line.

 

 

 

 

 

#include<iostream>

#include<cstring>

#include<cstdio>

#include<cmath>

#include<algorithm>

#include<map>

using namespace std;

const int N = 1e5+, M = 2e2+, inf = 2e9, mod = 1e9+;

int dp[N],a[N],pre[N],nex[N],n;

map<int,int >mp;

int main()

{

    while(scanf("%d",&n)!=EOF)

    {

        mp.clear();

        memset(dp,,sizeof(dp));

        for(int i=;i<=n;i++)scanf("%d",&a[i]);

        for(int i=;i<=n;i++)nex[i]=i+,pre[i]=i-;

        dp[]=,pre[]=-;

        for(int i=;i<=n;i++)

        {

            if(!mp[a[i]]) mp[a[i]]=i;

            else

            {

                int id = mp[a[i]];

                nex[pre[id]] = nex[id];

                pre[nex[id]] = pre[id];

                mp[a[id]] = i;

            }

            int num = ;

            for(int j=pre[i];j!=-;j=pre[j])

            {

                num++;

                dp[i] = min(dp[i],dp[j]+num*num);

                if(num*num>i) break;

            }

        }

        printf("%d\n",dp[n]);

    }

    return ;

}