import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
       
        int n = scanner.nextInt();
        int[] left = new int[n];
        int[] right = new int[n];
       
        for (int i = 0; i < n; i++) {
            left[i] = scanner.nextInt();
            right[i] = scanner.nextInt();
        }
       
        int sumLeft = 0;
        int sumRight = 0;
       
        for (int i = 0; i < n; i++) {
            sumLeft += left[i];
            sumRight += right[i];
        }
       
        if (sumLeft % 2 == 0 && sumRight % 2 == 0) {
            System.out.println(0);
            return;
        }
       
        boolean possible = false;
        for (int i = 0; i < n; i++) {
            int newSumLeft = sumLeft - left[i] + right[i];
            int newSumRight = sumRight - right[i] + left[i];
            if (newSumLeft % 2 == 0 && newSumRight % 2 == 0) {
                possible = true;
                break;
            }
        }
       
        if (possible) {
            System.out.println(1);
        } else {
            System.out.println(-1);
        }
    }
}

WNS is hiring Fresher

Apply link 👇

https://jobs.smartrecruiters.com/WNSGlobalServices144/743999933528002-associate-senior-associate-operations?trid=bb2572dc-93af-47bd-9bb1-9f049abba39c

Telegram:- @allcoding1

Juspay

=int(input())
dic={}
def addnode(u,v):
dic[u].append(v)
for i in range(N):
n1=int(input())
dic[n1]=[]

edge=int(input())
for i in range(edge):
u,v=map(int,input().split())
addnode(u,v)
start=int(input())
end=int(input())
tr=[]
tr.append(start)
def traverse(dic,start):
for i in dic[start]:
if(i==end):
return
if(len(dic[start])==0):
return
else:
tr.append(i)
traverse(dic,i)

traverse(dic,start)
tr=sorted(tr)
for i in tr:
print(i,end=" ")

HCL is hiring Fresher

Apply link 👇

https://www.hcltech.com/jobs/senior-analyst-2

WNS is hiring Fresher

Apply link 👇

https://jobs.smartrecruiters.com/WNSGlobalServices144/743999933528002-associate-senior-associate-operations?trid=bb2572dc-93af-47bd-9bb1-9f049abba39c

https://forms.office.com/pages/responsepage.aspx?id=N-edGDrJWk-LaG9MqZQZErhYpJunyJZKqf7OGiCnzjdUQ05CWkhPQUNUTU5TRzNGSUkxTlpOMzFXTC4u

#HCLTech is looking for experienced (6 to 24 months) or freshers SAP SD/MM/FICO (Global Certified) professionals.

· Highest Qualification for SAP- SD/MM– B. Tech (CSE/IT/ ECE/EEE) Only.
· Job Title: Software Engineer/Software Developer
· Highest Qualification for SAP FICO - B.Com (Finance) Only.
· Batch: 2021/2022/2023/2024 Only.
· Must have 60% and above throughout the academics.
· CTC offered: as per the standard HCLTech grid applicable (Basis 60% Percentage Eligibility Criteria)

Accenture Hackdiva hiring 2023 &. 2024 Batch

Apply link
https://indiacampus.accenture.com/events/hackdiva/

Genpact is hiring 2022/2023/2024

Apply link

https://forms.office.com/pages/responsepage.aspx?id=IIrvvayqgE-zoNmjL5n9M9suui6swjBImu7iaOx00hhUQ0xRSkVTVFgwRjRVMEczWVkxRzRVN0VCTC4u