In this task, you're given four sentences of a story written in natural language, and one last sentence (Sentence5). Your job is to classify whether the last sentence completes the rest of the story coherently or not by providing 'Yes' or 'No'.

Q: Sentence1: Tony and Mark were fierce rivals on the basketball court. Sentence2: Everyday after school they would meet at the local blacktop to play. Sentence3: They would always play one on one. Sentence4: They were always so evenly matched.
Sentence5: Tony would blowout Mark.

A: No
****
Q: Sentence1: Alex ran across town to get to a friends house. Sentence2: He didn't know his shoe was untied. Sentence3: He had ran for three block when it happened. Sentence4: He tripped on that shoelace of his.
Sentence5: Alex resolved to always check his shoelaces before leaving.

A: Yes
****
Q: Sentence1: Bill and Teddy were at the bar together. Sentence2: Bill noticed a pretty girl. Sentence3: He went up to her to flirt but she didn't like him. Sentence4: He was too drunk to talk properly.
Sentence5: Bill carefully added up the column of eight digit numbers.

A:
No
****