#include <iostream>
    #include <algorithm>
    #include <vector>
    using namespace std;
    bool IsOdd (int k) 
    {
        return (k % 3) == 1; 
    }
    int main () 
    {
        vector<int> num;
        for (int k = 1; k < 15; ++k) num.push_back(k);
        vector<int> :: iterator bound;
        bound = partition (num.begin(), num.end(), IsOdd);
        for (vector<int> :: iterator Iter = num.begin(); Iter != bound; ++Iter)
            cout << ' ' << *Iter;
        return 0;
    }