Maximum Value (Easy Version)

You are provided with two binary strings named $S$ and $T$ of length $N$ and $M$, respectively. You have to choose a subsequence $G$ of $S$ and a subsequence $H$ of $T$ such that the length of $G$ must be equal to the length of $H$. There is a function $F(X)$, such that: $F(X) = 2*Len(G) / (1 + 2*|X|)$ Where: $X$ = Binary string formed after converting $G$ and $H$ to binary integers and taking