#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<functional>
using namespace std;
int main() {
//2011 Problems A 每位数字和
/*int n = 1,number,numbers[1000],i=0,sum;
while (n != 0) {
sum = 0;
scanf_s("%d",&n);
number = n;
while (number != 0) {
sum += (number % 10);
number /= 10;
}
numbers[i] = sum;
i++;
}
numbers[i-1] = NULL;
i--;
sort(numbers,numbers+i);
for (int k=0; k < i; k++) {
if (k == i - 1) printf("%d",numbers[k]);
else printf("%d ", numbers[k]);
}*/
//2011 Problems B 马鞍点
/*int m, n, tix[100][100],number,min,ma[100][3],k=0;
cin >> m >> n;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
cin >> number;
tix[i][j] = number;
}
}
for (int i = 0; i < m; i++) {
bool flag = 1;
min = tix[i][0];
ma[k][0] = i;
ma[k][1] = 0;
ma[k][2] = tix[i][0];
for (int j = 0; j < n; j++) {
if (min > tix[i][j]) {
min = tix[i][j];
ma[k][0] = i;
ma[k][1] = j;
ma[k][2] = tix[i][j];
}
}
for (int l = 0; l < m; l++) {
if (ma[k][2] < tix[l][ma[k][1]]) {
flag = 0;
ma[k][0] = NULL; ma[k][1] = NULL; ma[k][2] = NULL;
break;
}
}
if (flag == 1) {
k++;
}
}
if (k == 0) {
printf("no\n");
}
else {
for (int i = 0; i < k; i++) {
printf("%d %d %d\n",ma[i][0], ma[i][1], ma[i][2]);
}
}*/
//2011 Problems C 字符串压缩
/*char ch[50] = { "a5b3aba13b4" };
char ch2[100];
int n = 0;
for (int i = 0; ch[i + 1] != NULL; i++) {
if (!(ch[i] >= '0'&&ch[i] <= '9') && !(ch[i + 1] >= '0'&&ch[i + 1] <= '9')) {
ch2[n] = ch[i];
n++;
}
else if (!(ch[i] >= '0'&&ch[i] <= '9') && (ch[i + 1] >= '0'&&ch[i + 1] <= '9') && (ch[i + 2] >= '0'&&ch[i + 2] <= '9')) {
for (int j = 0; j < (ch[i + 1] - 48) * 10 + ch[i + 2] - 48; j++) {
ch2[n] = ch[i];
n++;
}
i++;
i++;
}
else if (!(ch[i] >= '0'&&ch[i] <= '9') && (ch[i + 1] >= '0'&&ch[i + 1] <= '9') && !(ch[i + 2] >= '0'&&ch[i + 2] <= '9')) {
for (int j = 0; j < ch[i + 1] - 48; j++) {
ch2[n] = ch[i];
n++;
}
i++;
}
}
for (int j = 0; j<n; j++) {
cout << ch2[j];
}*/
//2011 Problems D Haffman
/*priority_queue<int, vector<int>, greater<int>> q;
int count, x, sum = 0;
cin >> count;
for (int i = 0; i < count; i++) {
cin >> x;
q.push(x);
}
while (q.size() > 1) {
int a = q.top();
q.pop();
int b = q.top();
q.pop();
sum += a + b;
q.push(a + b);
}
cout << sum << endl;*/
return 0;
}