static void solve(int mask, long acum) {
		if (pos)
			return;
		if (mask == 31) {
			if (acum == 23L)
				pos = true;
			return;
		}
		for (int i = 0; i < 5; i++)
			if ((mask & (1 << i)) == 0) {
				solve(mask | (1 << i), acum + v[i]);
				solve(mask | (1 << i), acum - v[i]);
				solve(mask | (1 << i), acum * v[i]);
			}
	}