How many queries can you do (concretely, not asymptotically) for a balanced Feistel network with 7 rounds?
The linked paper is missing a lot of proof details. In any case, it seems impossible to say anything concrete for finite $n$ due to the existence of terms in $O(\cdot)$ notation in the bounds. You simply do not know how large those implied constants are.