Untitled

// bai 1
#include<bits/stdc++.h>
using namespace std;

void nhap(int a[], int n)
{
	for (int i = 0; i < n; i++)
	{
		cin>>a[i];
	}
}

void sapxep (int a[], int n) //Bubble sort
{
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n - i - 1; j++)
		{
			if (a[j] > a[j + 1])
			{
				int tg = a[j];
				a[j] = a[j + 1];
				a[j + 1] = tg;
			}
		}
	}
}

int main()
{
	int n; cin>>n;
	int a[n];
	nhap(a, n);
	sapxep(a, n);
	for (int i = 0; i < n; i++)
	{
		cout<<a[i]<<" ";
	}
	cout<<endl;
	for (int i = n - 1; i >= 0; i--)
	{
		cout<<a[i]<<" ";
	}
	
	return 0;
}
// bai 2
#include <bits/stdc++.h>
using namespace std;

void nhap(int a[], int n)
{
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
}

int main()
{
	int n, m;
	cin >> n >> m;
	int a[n], b[m];
	nhap(a, n);
	nhap(b, m);
	int i = 0, j = 0, count = 0;
	int ans[m + n];
	while (i < n && j < m)
	{
		if (a[i] < b[j])
		{
			ans[count++] = a[i++];
		}
		else
		{
			ans[count++] = b[j++];
		}
	}

	while (i < n)
	{
		ans[count++] = a[i++];
	}

	while (j < m)
	{
		ans[count++] = b[j++];
	}

	for (int i = 0; i < count; i++)
	{
		cout << ans[i] << " ";
	}

	return 0;
}
// bai 3
#include <bits/stdc++.h>
using namespace std;

bool SoNguyenTo(int a)
{
	if (a == 1)
	{
		return false;
	}
	for (int i = 2; i * i <= a; i++)
	{
		if (a % i == 0)
		{
			return false;
		}
	}
	return true;
}

int main()
{
	int n, ans = 0;
	cin >> n;
	int a[n][n];

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			cin >> a[i][j];
		}
	}

	for (int i = 0; i < n; i++)
	{
		for (int j = i; j < n; j++)
		{
			if (SoNguyenTo(a[i][j]))
			{
				ans += a[i][j];
			}
		}
	}
	cout << endl
			 << ans;

	return 0;
}
// bai 4
#include <bits/stdc++.h>
using namespace std;

int main()
{
	int n;
	cin >> n;
	int a[n][n];

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			cin >> a[i][j];
		}
	}

	for (int j = 0; j < n; j++)
	{
		for (int i = 0; i < n; i++)
		{
			int maxpos = i;
			for (int x = i + 1; x < n; x++)
			{
				if (a[x][j] > a[maxpos][j])
				{
					maxpos = x;
				}
			}
			int tg = a[i][j];
			a[i][j] = a[maxpos][j];
			a[maxpos][j] = tg;
		}
	}

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			cout << a[i][j] << " ";
		}
		cout << endl;
	}
}
// bai 5 
#include <bits/stdc++.h>
using namespace std;

void nhap(int a[], int n)
{
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
}

int main()
{
	int n;
	cin >> n;
	int a[n];
	nhap(a, n);
	int ans = (n + 1) * n / 2;
	for (int i = 0; i < n; i++)
	{
		ans -= a[i];
	}
	cout << ans;
}