#include <iostream>
#include <list>
#include <algorithm>
using std::list;
using std::cout;
using std::endl;
int main()
{
list<int> lst = { 3, 8, 6, 9, 7, 6, 2 };
list<int>::iterator pos1;
pos1 = find(lst.begin(), lst.end(), 6);
list<int>::iterator pos2;
if (pos1 != lst.end())
pos2 = find(++pos1, lst.end(), 6);
cout << std::distance(lst.begin(), pos2) << endl;
return 0;
}
/*
run:
5
*/