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

using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> divisors;

    if (n % 3 == 0) divisors.push_back(3);
    if (n % 5 == 0) divisors.push_back(5);
    if (n % 7 == 0) divisors.push_back(7);

    sort(divisors.begin(), divisors.end());

    if (divisors.empty()) {
        cout << 'n' << endl;
    } else {
        for (int d : divisors) {
            cout << d << endl;
        }
    }

    return 0;
}