You will be given a definition of a task first, then some input of the task.
Given a disfluent sentence, modify the sentence to it to its equivalent fluent form, preserving the meaning of the sentence.

According to Gluga's theorem, what  period rather factorial must be divisible by n if some integer n > 4 is to be considered composite?
Output:
According to Gluga's theorem, what factorial must be divisible by n if some integer n > 4 is to be considered composite?