CodeForces 830B Cards Sorting（set乱搞）

题目链接：http://codeforces.com/problemset/problem/830/B点击打开链接

B. Cards Sorting

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasily has a deck of cards consisting of n cards. There is an integer on each of the cards, this integer is between 1 and 100 000, inclusive. It is possible that some cards have the same integers on them.

Vasily decided to sort the cards. To do this, he repeatedly takes the top card from the deck, and if the number on it equals the minimum number written on the cards in the deck, then he places the card away. Otherwise, he puts it under the deck and takes the next card from the top, and so on. The process ends as soon as there are no cards in the deck. You can assume that Vasily always knows the minimum number written on some card in the remaining deck, but doesn't know where this card (or these cards) is.

You are to determine the total number of times Vasily takes the top card from the deck.

Input

The first line contains single integer n (1 ≤ n ≤ 100 000) — the number of cards in the deck.

The second line contains a sequence of n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 100 000), where a_i is the number written on the i-th from top card in the deck.

Output

Print the total number of times Vasily takes the top card from the deck.

Examples

Input

4
6 3 1 2

Output

7

Input

1
1000

Output

1

Input

7
3 3 3 3 3 3 3

Output

7

Note

In the first example Vasily at first looks at the card with number 6 on it, puts it under the deck, then on the card with number 3, puts it under the deck, and then on the card with number 1. He places away the card with 1, because the number written on it is the minimum among the remaining cards. After that the cards from top to bottom are [2, 6, 3]. Then Vasily looks at the top card with number 2 and puts it away. After that the cards from top to bottom are [6, 3]. Then Vasily looks at card 6, puts it under the deck, then at card 3 and puts it away. Then there is only one card with number 6 on it, and Vasily looks at it and puts it away. Thus, in total Vasily looks at 7 cards.

大牛博客上习得乱搞思想 将每次取牌分为成功的取牌（也就是拿走）与不成功的取牌（放到队列尾）

这样一来维护当前取牌的位置和寻找下一个需要取得位置 如果不需要循环则不需要加上牌堆数 如果需要则加上失败数量

set保存每个点的出现位置 然后lowerbound二分寻找下一个数的位置 如果找不到则说明需要进行循环

#include <bits/stdc++.h>
#define maxn 100005
using namespace std;
set<int > point[maxn];
set<int > ::iterator it ;
int a[maxn];
int main()
{
    int n;int total;

    cin >> n;
    for(int i=1;i<=n;i++)
    {
        cin >> a[i];
        point[a[i]].insert(i);
    }
    total=n;
    long long int ans=n;
    int mid=0;
    sort(a+1,a+1+n);
    for(int i=1;i<=n;i++)
    {
        int now=a[i];
        it=point[now].lower_bound(mid);
        if(it==point[now].end())
        {
            ans+=total;
            mid=0;
            it=point[now].lower_bound(mid);
        }
        mid=(*it);
        point[now].erase(it);
        total--;
    }
    cout <<ans << endl;
}