#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<functional>
#include<climits>

using namespace std;

class ORSolitaireDiv2{
public:
	int getMinimum(vector <int> numbers, int goal){
		int cnt=INT_MAX;

			for(int i=0;i < (1<<numbers.size());i++){
				int num=0;
				for(int j=0; j < numbers.size();j++){
					if(!(i & 1<<j) && (goal|numbers[j]) == goal)
						num = num | numbers[j];
				}
				
				if(num != goal){
					int cnt1=0;
					for(int j=1; j < (1<<numbers.size());j=j<<1)
						if((i & j)) cnt1++;
					cnt = std::min(cnt,cnt1);
				}
			}
		return cnt;
	}
};