This is a nice example of an unfamiliar looking test. Studying it therefore helps us understand the fundamental concepts better.
Because the sum $t_n=X_1+X_2+\cdots+X_n$ is a sufficient statistic, we may focus the analysis on it. Let the two hypotheses be written $H_{0.5}$ and $H_{0.75}$. Under hypothesis $H_p$, $t_n$ has a Binomial$(n,p)$ distribution with possible values in the set $[n]=\{0,1,2,\ldots,n\}$.
Inspired by the Neyman-Pearson theory, we would naturally seek a critical region to be a subset of possible values of $t_n$ that have small probabilities under both hypotheses. Such values are far from both $0.5n$ and from $0.75n$, which are close to the modes under the hypotheses. Evidently such a critical region will then comprise, at most, three intervals: one from $0$ to, say, $c_1 \lt 0.5 n$; another from $c_2\gt0.5 n$ to $c_3\lt 0.75 n$; and a third from $c_4\gt 0.75n $ to $n$. The critical region will be of the form
$$C_n(\alpha) = [0, c_1] \cup [c_2,c_3] \cup [c_4, n].$$
For either hypothesis $p\in\{0.5,0.75\}$ we need
$${\Pr}_p(t_n \in C_n) \le 0.05$$
and we would like this probability to be as close to $0.05$ as possible for both hypotheses.
For large $n$ we could estimate these cutpoints $c_i$ using Normal approximations and then check. For smaller $n$ we may do a brute force search over all possibilities. I like this approach because it will not be approximate: it will give us the best possible solution, which can be instructive. (It might, however, take considerable time to find, especially for small test sizes $\alpha$! The brute force search described below takes about a minute for $\alpha=0.01$, for instance ($n=68$ is the smallest sample sizes that admits such a simultaneous test of level $0.01$).)
If more than one critical region is found for a given $n$, we might then select the one that covers the most ground--has the longest total length. That will help make it most powerful among many alternatives. Among such critical regions, if there is more than one, let's take the one for which the false positive rates are as close as possible to each other so as not to favor one hypothesis over the other.
The smallest $n$ with any solution is $n=35$. The best solution in the preceding sense is
$$C_{35}(0.05) = [0,9] \cup [22,22] \cup [33,35].$$

Here is a plot of the probability functions of both hypotheses, distinguished by color. The critical region $C_{35}(0.05)$ is located within the darker background areas. For each hypothesis, the chance of being in one of the darker areas is less than, but almost equal to, $\alpha=0.05$.
In other words, reject either hypothesis if $t_{35}$ is less than or equal to $9$, equal to $22$, or greater than or equal to $33$. The chances of this event are $0.046$ under $H_{0.5}$ and $0.0426$ under $H_{0.75}$.
Notice how both hypotheses are (of course) rejected when $t_{35}$ is near $0$ or near $n$, which is rare under either hypothesis; that both are rejected when $t=22$, which is not terribly rare under either hypothesis; and that many outcomes for which neither is rejected are outcomes that are common for one of the hypotheses but rare for the other.