Teacher: You are given a dialog between 2 or more individuals. You need to generate the number of the speaker (e.g. 1 for Speaker 1) who had the most lines in the dialog. If there is a tie, output the answer '0'.
Teacher: Now, understand the problem? If you are still confused, see the following example:
Speaker 1: What do you think we should do for our 10th wedding anniversary?
Speaker 2: Hm, how about we take a vacation? Somewhere sandy and warm.
Speaker 1: Well, if we're going to go out of the country, you need to be sure to renew your passport. It expired over a year ago!
Speaker 2: How about we get something expensive instead of travelling. We could get a new car.
Speaker 1: Is this your way of telling me that you want me to buy you a car?
Solution: 1
Reason: In this dialog, there are 5 lines of speech. Three of them belong to Speaker 1 and two of them belong to Speaker 2. Therefore, Speaker 1 has the most lines in the dialog.

Now, solve this instance: Speaker 1: Welcome everybody, welcome to Amazing Discoveries!
Speaker 2: Oh, oh! It's on again!
Speaker 3: You guys, can we please not watch this all right.
Speaker 4: Shhhh!
Speaker 1: Folks, has this ever happened to you. You go to the refrigerator to get a nice glass of milk, and these darn cartons are so flingin'-flangin' hard to open.
Speaker 3: Oh, you said it Mike. Aw! There's got to be a better way!
Speaker 5: And there is Kevin.
Speaker 3: Can we please turn this off?
Speaker 6: Noo way, Kevin.
Speaker 5: There is a revolutionary new product that guarantees that you'll never have to open up milk cartons again. Meet the Milk Master 2000.
Speaker 7: Are you intrigued?
Speaker 8: You're flingin'-flangin' right I am!
Speaker 5: Keep in mind, he's never used this product before, you're gonna see how easy this is to do. Go ahead. This works with any milk carton.
Speaker 3: Wow, it is easy. Now, I can have milk everyday.
Student:
3