#include <list>
#include <iostream>

using namespace std;

bool is_prime(int n) {
    for (int divisor=2; divisor<n; divisor++)	// Holy smokes, this is slow!
	if (n % divisor == 0)
	    return false;
    return true;
}

int main() {
    list<int> primes;

    for (int candidate=2; candidate<100; candidate++)
	if (is_prime(candidate))
	    primes.push_back(candidate);

    for (auto v : primes)
	cout << v << ' ';
    cout << '\n';
}