#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
	int numbers[50],sum[5];
	for (int i = 0; i < 50; i++)
	{
		cin>>numbers[i];
	}
	for (int i = 0; i < 5; i++)
	{
		cin>>numbers[i];
	}
	 int n = sizeof(numbers) / sizeof(numbers[0]);
	 for (int i = 0; i < 5; i++)
	 {	 	
    int target = sum[i];
    int* targetPtr = find(&numbers[0], numbers + n, target);

    int targetIndex = targetPtr - numbers;

    if (targetIndex > 49)
        cout << "Element not Found!\n";
    else
        cout << "Element"<<sum[i]" Found at Index: " << targetIndex;
	 }

	return 0;
}