#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> vec = {1, 2, 3, 4, 1, 2, 3, 4, 1, 1, 2, 7, 5, 5};
sort(vec.begin(), vec.end());
auto it = vec.begin(), end = vec.end();
while(it != end) {
auto tmp_it = find_if_not(it, end, [&](const int value) { return value == *it; });
if(distance(it, tmp_it) == 2) cout << *it << "\n";
it = tmp_it;
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7Cgl2ZWN0b3I8aW50PiB2ZWMgPSB7MSwgMiwgMywgNCwgMSwgMiwgMywgNCwgMSwgMSwgMiwgNywgNSwgNX07Cglzb3J0KHZlYy5iZWdpbigpLCB2ZWMuZW5kKCkpOwoJYXV0byBpdCA9IHZlYy5iZWdpbigpLCBlbmQgPSB2ZWMuZW5kKCk7Cgl3aGlsZShpdCAhPSBlbmQpIHsKCQlhdXRvIHRtcF9pdCA9IGZpbmRfaWZfbm90KGl0LCBlbmQsIFsmXShjb25zdCBpbnQgdmFsdWUpIHsgcmV0dXJuIHZhbHVlID09ICppdDsgfSk7CgkJaWYoZGlzdGFuY2UoaXQsIHRtcF9pdCkgPT0gMikgY291dCA8PCAqaXQgPDwgIlxuIjsKCQlpdCA9IHRtcF9pdDsKCX0KCXJldHVybiAwOwp9