#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main() {
	int a[] = {1,1,1,2,2,3,3,3,4,4,5,5,5,1,3};
	vector<int> vec(a, a+15);
	
	sort(vec.begin(), vec.end());
	
	vector<int>::iterator it;
    it = unique(vec.begin(), vec.end());
    vec.resize( distance(vec.begin(),it) );
    
    for( vector<int>::iterator i = vec.begin(); i!= vec.end(); ++i)
    	cout << (*i) << endl;
    	
	return 0;
}