This is an extension of Two times three equals five.

Form words length of 2n-1 (n ≥ 3) such that, each (2n-1) letter word is the result of two n-letter words, the final letter of the first being the initial one of the second word. (It may be observed that, rip & pen → ripen is a valid example when n = 3.)

What is the largest value of n for which this is possible?

*** Proper nouns, acronyms, abbreviations, hyphens or spaces are not allowed.