#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int a[10] = { 1, 1, 1, 2, 3, 8 , 12, 98, 1, -9 };
auto it = find(begin(a), end(a), 12);
if (it != end(a)) cout << *it << " found at position " << distance(begin(a), it) ; else cout << "not found";
return 0;
}