int search(char A[], int B[], int n, char tp, int dd) //Search for number
{
	int ind = -1;
	for (int i = 0; i < n; i++)
		if ((A[i] == tp) && (B[i] == dd))
			ind = i;
	return ind;
}
void remove(char A[], int B[], int & n, int ind) //remove number from array
{
	for (int i = ind; i < n - 1; i++)
	{
		A[i] = A[i + 1];
		B[i] = B[i + 1];
	}
	n--;
}