#include <vector>
#include <algorithm>
#include <iostream>
 
using namespace std;
 
int main(void){
    int n=30;
    vector<int> possible_answers({0,4,7,10});
    int max_answer = n * *(max_element(possible_answers.begin(),possible_answers.end()));
    vector<bool> reachable(max_answer,false);
    reachable[0] = true;
    for (int i=0;i<n;++i){
        vector<bool> reachable_next(reachable);
        for (int j=0;j<max_answer;++j){
            if (reachable[j]) {
                for (int k : possible_answers){
                    if(j+k<max_answer){
                         reachable_next[j+k] = true;
                    }
                }      
            }
        }
        reachable=reachable_next;        
    }
    for (int i=0;i<max_answer;++i){
        if(!reachable[i]){
            cout<<i<<'\n';
        }
    }
    
}