#include <cstdio>
#include <queue>
using namespace std;

const int DNUM = 100;

int main(void)
{
	int pre = 0, i = 0;
	priority_queue<int, vector<int>, greater<int> > pq;
	pq.push(1);
	
	while(i < DNUM)
	{
		int a = pq.top();
		pq.pop();
		if(a == pre) continue;
		
		printf("%d\n", a);
		pq.push(a * 2);
		pq.push(a * 3);
		pq.push(a * 5);
		
		pre = a;
		i++;
	}
	
	return 0;
}