1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38
39. 39
40. 40
41. 41
42. 42
43. 43
44. 44
45. 45
46. 46
47. 47
48. 48
49. 49
50. 50
51. 51
52. 52
53. 53
54. 54
55. 55
56. 56
57. 57
58. 58
59. 59
60. 60
61. 61
62. 62
63. 63
64. 64
65. 65
66. 66
67. 67
68. 68
69. 69
70. 70
71. 71
72. 72
73. 73
74. 74
75. 75
76. 76
77. 77
78. 78
79. 79
80. 80
81. 81
82. 82
83. 83
84. 84
85. 85
86. 86
87. 87
88. 88
89. 89
90. 90
91. 91
92. 92
93. 93
94. 94
95. 95
96. 96
97. 97
98. 98
99. 99
100. 100
101. 101
102. 102
103. 103
104. 104
105. 105
106. 106
107. 107
108. 108
109. 109
110. 110
111. 111
112. 112
113. 113
114. 114
115. 115
116. 116
117. 117
118. 118
119. 119
120. 120
121. 121
122. 122
123. 123
124. 124
125. 125
126. 126
127. 127
128. 128
129. 129
130. 130
131. 131
132. 132
133. 133
134. 134
135. 135
136. 136
137. 137
138. 138
139. 139
140. 140
141. 141
142. 142
143. 143
144. 144
145. 145
146. 146
147. 147
148. 148
149. 149
150. 150
151. 151
152. 152
153. 153
154. 154
155. 155
156. 156
157. 157
158. 158
159. 159
160. 160
161. 161

#include <algorithm>
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cstring>
#define init_io(pname) ifstream cin((string)pname+".in"); ofstream cout((string)pname+".out"); ios_base::sync_with_stdio(false); cin.tie(NULL)
#define FOR(i, a, b, in) for (int i = (a); i < (b); i += in)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b, in) for (int i = (a) - 1; i >= (b); i -= in)
#define RREP(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define trav(a, x) for (auto& a : x)
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize
#define mem(a, b) memset(a, (b), sizeof(a))
using namespace std;
typedef string str;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii; typedef pair<ll, ll> pl; typedef pair<ld, ld> pd;
typedef vector<int> vi; typedef vector<ll> vl; typedef vector<ld> vd;
typedef vector<ii> vii; typedef vector<pl> vpl; typedef vector<pd> vpd;
constexpr auto INF = (int)1e9;
constexpr auto LINF = (ll)1e18;

template<typename T> class fenwick_tree {
private: vector<T> FT;
public:
	fenwick_tree(int N) { FT.assign(N + 1, 0); }
	void clear() { FT.assign(FT.size(), 0); }
	void update(int x, T val) { if (x > 0) for (; x < FT.size(); x += x & -x) FT[x] += val; }
	T query(int x) { T ret = 0; if (x > 0) for (; x > 0; x -= x & -x) ret += FT[x]; return ret; }
	T query(int x, int y) { return query(y) - (x == 1 ? 0 : query(x - 1)); }
};

template< typename T > class seg_tree {
private:
	int N;
	vector<T> seg, tmp;
public:
	seg_tree(int size) {
		N = size;
		seg.resize(4 * N, 0);
		tmp.resize(4 * N, 0);
	}
	seg_tree(int size, T A[]) {
		N = size;
		seg.resize(4 * N);
		tmp.resize(4 * N);
		build(A);
	}
	seg_tree(vector<T>& A) {
		N = A.size();
		seg.resize(4 * N);
		tmp.resize(4 * N);
		build(A);
	}
	void clear() { seg.assign(4 * N, 0); }
	void pull(int n) { seg[n] = max(seg[n << 1], seg[n << 1 | 1]); }
	void push(int l, int r, int n) {
		seg[n] += tmp[n];
		if (l != r) tmp[n << 1] += tmp[n], tmp[n << 1 | 1] += tmp[n];
		tmp[n] = 0;
	}
	void build(T A[], int l = 0, int r = -1, int n = 1) {
		if (r == -1) r = N - 1;
		if (l == r) seg[n] = A[l];
		else {
			int m = (l + r) >> 1;
			build(A, l, m, n << 1), build(A, m + 1, r, n << 1 | 1);
			pull(n);
		}
	}
	void build(vector<T>& A, int l = 0, int r = -1, int n = 1) {
		if (r == -1) r = N - 1;
		if (l == r) seg[n] = A[l];
		else {
			int m = (l + r) >> 1;
			build(A, l, m, n << 1);
			build(A, m + 1, r, n << 1 | 1);
			pull(n);
		}
	}
	void update(int x, T v, int l = 0, int r = -1, int n = 1) {
		if (r == -1) r = N - 1;
		if (l == r) seg[n] += v;
		else {
			int m = (l + r) >> 1;
			x <= m ? update(x, v, l, m, n << 1) : update(x, v, m + 1, r, n << 1 | 1);
			pull(n);
		}
	}
	void update_range(int a, int b, T v, int l = 0, int r = -1, int n = 1) {
		if (r == -1) r = N - 1;
		push(n, l, r);
		if (l > b || r < a) return;
		if (l >= a && r <= b) {
			tmp[n] = v;
			push(n, l, r);
		}
		else {
			int m = (l + r) >> 1;
			update_range(a, b, v, l, m, n << 1), update_range(a, b, v, m + 1, r, n << 1 | 1);
			pull(n);
		}
	}
	T query(int a, int b, int l = 0, int r = -1, int n = 1) {
		if (r == -1) r = N - 1;
		if (l > b || r < a) return 0;
		push(n, l, r);
		if (l >= a && r <= b) return seg[n];
		int m = (l + r) >> 1;
		return max(query(a, b, l, m, n << 1), query(a, b, m + 1, r, n << 1 | 1));
	}
};

int A[100005], C[100005] = { 0 };

int main() {
	init_io("sort");

	int N;
	cin >> N;
	for (int i = 0; i < N; i++) cin >> A[i];
	vector<ii> tmp;
	for (int i = 0; i < N; i++) tmp.emplace_back(A[i], i);
	sort(tmp.begin(), tmp.end());
	for (int i = 0; i < N; i++) A[tmp[i].second] = i;

	ll ans = 0;
	fenwick_tree<int> FT(N);
	seg_tree<int> seg(N);
	for (int i = 0; i < N; i++) {
		ans += FT.query(A[i], N - 1);
		FT.update(A[i], 1);
	}
	for (int i = 0; i < N; i++) seg.update(A[i], i);
	for (int i = 0; i < N; i++) {
		int q = seg.query(0, A[i]);
		if (i != q) C[i]++, C[q]--, ans++;
	}
	FT.clear();
	for (int i = N - 1; i >= 0; i--) {
		ans += (ll)C[i] * FT.query(A[i], N - 1);
		FT.update(A[i], 1);
	}
	cout << (ans ? ans : N) << endl;
}