#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <iterator>
using namespace std;

int main() {
	unordered_map<int, bool> m;
	int i = -1;
	std::generate_n(std::inserter(m, m.begin()),
	                10,
	                [&i](){++i; return std::make_pair(i, i % 2 == 0);});
	for (auto const &p: m) 
	    std::cout << '<' << p.first << ", " << p.second << ">\n";
	return 0;
}