#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <climits>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()

enum FACE { TOP, BOTTOM, FRONT, BACK, LEFT, RIGHT };
template <class T>
class dice {
public:
    dice() {
        id[TOP] = 0; id[FRONT] = 1; id[LEFT] = 2;
        id[RIGHT] = 3; id[BACK] = 4; id[BOTTOM] = 5;
    }
    T& operator[] (FACE f) { return var[id[f]]; }
    const T& operator[] (FACE f) const { return var[id[f]]; }
    bool operator==(const dice<T>& b) const {
        const dice<T> &a = *this;
        return a[TOP] == b[TOP] && a[BOTTOM] == b[BOTTOM] &&
               a[FRONT] == b[FRONT] && a[BACK] == b[BACK] &&
               a[LEFT] == b[LEFT] && a[RIGHT] == b[RIGHT];
    }
    void roll_x() { roll(TOP, BACK, BOTTOM, FRONT); }
    void roll_y() { roll(TOP, LEFT, BOTTOM, RIGHT); }
    void roll_z() { roll(FRONT, RIGHT, BACK, LEFT); }
    vector<dice> all_rolls() {
        vector<dice> ret;
        for (int k = 0; k < 6; (k&1?roll_y():roll_x()),++k)
            for (int i = 0; i < 4; roll_z(), ++i)
                ret.push_back(*this);
        return ret;
    }
    bool equivalent_to(const dice& di) {
        for (int k = 0; k < 6; (k&1?roll_y():roll_x()),++k)
            for (int i = 0; i < 4; roll_z(), ++i)
                if (*this == di) return true;
        return false;
    }
private:
    void roll(FACE a, FACE b, FACE c, FACE d) {
        T tmp = id[a];
        id[a] = id[b]; id[b] = id[c];
        id[c] = id[d]; id[d] = tmp;
    }
    T var[6];
    int id[6];
};

struct Edge {
    int to, cost;
    Edge(int to, int cost): to(to), cost(cost) {}
};

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<Edge>> AdjList;
AdjList graph;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
const int INF = 100000000;

int GCD(int a, int b){
    if(a < b) swap(a, b);
    if(b == 0) return a;
    return GCD(b, a%b);
}

struct dat{
    int to, cost;
    dat(int a, int b){
        to = a;
        cost = b;
    }
};
bool cmp(const pii& a, const pii& b){
    if(a.first == b.first){
        return a.second < b.second;
    }
    return a.first < b.first;
}

vector<int> v;
bool sieve[300010];
int main() {
    //cout << fixed << setprecision(15);

    int n;
    while(cin >> n) {
        if(n == 1) break;
        REP(i, 300010) sieve[i] = true;

        for(int i=0; i<300010; ++i){
            if(i%7!=1 && i%7!=6) sieve[i]=false;
        }


        for (int i = 6; i <= n; ++i){
            if(i%7==1 || i%7==6) {
                if (sieve[i] && n % i == 0) {
                    int a = n / i;
                    if (a % 7 == 1 || a % 7 == 6) {
                        for (int j = 2; j * i <= n; ++j) {
                            sieve[i * j] = false;
                        }
                    } else{
                        sieve[i] = false;
                    }
                }else{
                    sieve[i] = false;
                }
            }
        }

        vector<int> ans;
        for(int i=2; i<=n; ++i){
            if(sieve[i] && (i%7==1 || i%7==6)) ans.push_back(i);
        }

        cout << n << ":";
        for(int i=0; i<ans.size(); ++i){
            cout << " " << ans[i];
        }
        cout << endl;

    }
    return 0;
}


Measured memory_bytes: 3296