import java.util.*;

public class SumOfOddSequence {

public static void main(String[] args) {
		
		int array[] = {13, 15, 12, 18, 18, 14, 5, 3, 1, 12, 13, 32, 34, 5, 7, 9, 66, 78, 78, 79};

        List<Integer> counts = new ArrayList<Integer>();
        List<Integer> sums = new ArrayList<Integer>();

    	int count = 0, sum = 0, result = 0;
    	
    	for(int i = 0; i < array.length; i++) {
    		if(array[i]%2 != 0) {
    			sum = sum + array[i];
    			count++;
    			if(i == (array.length-1)) {
    				counts.add(count);
    				sums.add(sum);
    			}
    		}
    		else {
				counts.add(count);
				sums.add(sum);
    			count = sum = 0;
    		}
    	}
    	
    	int longest = Collections.max(counts);
    
    	for(int i = 0; i < counts.size(); i++) {
    		if(counts.get(i) == longest) {
    			result = result + sums.get(i);
    		}
    	}

    	System.out.println(result);
	}

}