Reverse words in a string if their length is even.

Difficulty: Medium

Phase: 6 · Mixed Logical Challenges

XP Reward: 20 XP

Topics: Mixed Logical Challenges, Medium

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Given R and C followed by an R x C matrix, find the 0-based index of the row with the maximum sum. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

-10^9 <= N <= 10^9

Examples

Example 1

Input: 3 2 1 2 5 6 3 1

Output: 1

Explanation: Sample execution for input 3 2 1 2 5 6 3 1