Eh. The rule could be that answers should consist of the n first letters of the infinite letter sequence (Q')*, where n is an arbitrary natural number, and Q' is the question but with all blanks removed, and the symbol * is defined by the fact that X* (where X is any arbitrary string of letters) stands for the infinite string that is constructed by repeating X infinitely many times. But of course this possibility is only a red herring...

Eh. The rule could be that answers should consist of the n first letters of the infinite letter sequence (Q')*, where n is an arbitrary natural number, and Q' is the question but with all blanks removed, and the symbol * is defined by the fact that X* (where X is any arbitrary string of letters) stands for the infinite string that is constructed by repeating X infinitely many times. But of course this possibility is only a red herring... Uh, I think you're right. But you need to determine what is n

S? So? So ? So n? So n ? So n i? So n is? So n is ? So n is c? So n is ca? So n is cal? So n is calc? So n is calcu? So n is calcul? So n is calcula? So n is calculat? So n is calculate? So n is calculated? So n is calculated ? So n is calculated s? So n is calculated so? So n is calculated som? So n is calculated some? So n is calculated someh? So n is calculated someho? So n is calculated somehow? oksoniscalculatedinsomeway?

Let Q be an arbitrary question, consisting of a sequence of letters and/or other symbols. Construct the string Q', such that Q' is the same as Q except that all non-alphabetic symbols have been eleminated from it.

Let the length of Q' be |Q'|, and let the letters of Q', in order from the first one to the last one, be named q'1, q'2, ... , q'|Q'|.

Define the concept "syllable" like this: a syllable of a string S is any substring of S which consists of one vowel v which occurs in S, together with all the consonants which precede v in S, no more no less, and all these letters in the same order as they occur in S.

Let the length of a syllable s of be written as |s|.

Let p be the number of syllables in Q', and let s1, s2, ..., sp be the syllables which occur in Q', in order from the first syllable to the last one.

Finally, let the function which turns an arbitrary letter x from uppercase to lowercase (if it's not already in lowercase) be called lower(x).

Then, in this rulebreaker puzzle, the answer A(Q) to the question Q is undefined in case p = 0. Otherwise, A(Q) is a string of length |A(Q)|, consisting of letters a1, a2, ..., a|A(Q)¦ such that a1 = q'1, and that for all x in the interval 2 < x < |A(Q)| ,

ax = lower(q'x modulo |Q'|),

and where |A(Q)| is given as the sum of all terms (p - i + 1) * |si| generated by letting i take all values between 1 and p.

Find all vowels in the question (without spaces and non-alphabetic symbols, for the sake iof simplicity). Then, add their positions (e.g. if a vowel is a 3rd letter of the word, its position = 3) to get a sum S. Then, repeat the letters of the question to get a string of length S.