friend MED<T> & operator +(MED<T> & left, MED<T> & right)
	{
		int g = 0;
		for (int i = 0; i < left.getcount(); i++)
		{
			for (int j = 0; j < right.getcount(); j++)
			{
				if (strcmp(left[i].Name, right[j].Name) == 0)
					g++;
			}
		}
		int h = left.getcount() + right.getcount() - g;
		MED <T> result(h);
		int y = 0;
		for (int i = 0; i < left.getcount(); i++)
		{
			result[i] = left[i];
			y++;
		}
		int k = 0;
		for (int j = 0; j < right.getcount(); j++)
		{
			k = 0;
			for (int i = 0; i < left.getcount(); i++)
			{
				if (strcmp(left[i].Name, right[j].Name) == 0)
					k++;
			}
			if (k == 0)
			{
				result[y] = right[j];
				y++;
			}
		}
		result.setcount(y);
		cout << result;
		return result;
	}