# Odd Sum Array (Contest)

Problem Statement : 

You are given an array A of size N. In one move, you can swap Ai and Ai+1 if Ai + Ai+1 is odd. Find out if you can sort this array non- decreasingly after performing any (possibly 0) number of moves. Input The first line of the input contains a single integer N. The second line of the input contains N space separated integers.

Constraints: 1 <= N <= 105 1 <= Ai <= 109 Output Print "YES" if you can sort the array non- decreasingly, else print "NO", without the quotes. Example Sample Input: 4 1 6 31 14

Sample Output: YES

link:<https://my.newtonschool.co/playground/code/jagr8u5cjc4w/>

````java
```java
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }
        sc.close();

        boolean isSorted = true;
        for (int i = 0; i < n - 1; i++) {
            if (arr[i] > arr[i + 1]) {
                if ((arr[i] + arr[i + 1]) % 2 == 0) {
                    isSorted = false;
                    break;
                }
            }
        }
        if (isSorted) {
            System.out.println("YES");
        } else {
            System.out.println("NO");
        }
    }
}
 
 //method 02
 ```java
import java.io.*; // for handling input/output
import java.util.*; // contains Collections framework

// don't change the name of this class
// you can add inner classes if needed
class Main {
    public static void main (String[] args) {
        // Your code here
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        long arr[]=new long[n];
   for(int i=0;i<n;i++){
       arr[i]=sc.nextInt();
   }
   for(int i=1;i<n;i++){
    if(arr[i-1]>arr[i]){
        if((arr[i-1]+arr[i])%2==0){
            System.out.println("NO");
            return;
        }
        else{
            long temp= arr[i-1];
            arr[i-1]=arr[i];
            arr[i]=temp;
        }
    }
   }
   System.out.print("YES");

    }
}
```
````


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://anand-aryan.gitbook.io/placecom-question/odd-sum-array-contest.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.