problem is this.

https://codeforces.com/contest/1003/problem/F

i can't understand why the answer for test case below is 5

3 abcdef abcdef abcdef

my program (and i ) think A abcdef A is optimal so output 10

vovuh's solution output 5.

how 5 is possible? since we should select non-intersecting segments, at least one abcdef should remain and the answer must >=6. need help for this.

i think it's ok to choose three words,so the answer can be 'A A A'.

I hope i haven't made mistakes because of my poor English.

oh i thought i should select exactly 2 segments of any length. i'll try out choosing several segments. thank you