int k(int o[]){
		SortedSet<Double> p = new TreeSet<Double>();
		for(int a = 1; a <= 4; a++){
			for(int b = 1; b <= 4; b++){
				if(b == a) continue;
				for(int c = 1; c <= 4; c++){
					if(c == a || c == b) continue;
					for(int d = 1; d <= 4; d++){
						if(d == c || d == a || d == b) continue;
						p.addAll(h(o[a-1],o[b-1],o[c-1],o[d-1]));
					}
				}
			}
		}
		int c = 1;
		for(double i : p){
			int j = (int)i;
			if(i == j && j > 0){
				if(j != c) break;
				c++;
			}
		}
		return c-1;
	}