Skip to content

Latest commit

 

History

History
15 lines (7 loc) · 400 Bytes

README.md

File metadata and controls

15 lines (7 loc) · 400 Bytes

Lonely-Integer

Problem Statement

There are N integers in an array A. All but one integer occur in pairs. Your task is to find the number that occurs only once.

Input Format

The first line of the input contains an integer N, indicating the number of integers. The next line contains N space-separated integers that form the array A.

Output Format

Output S, the number that occurs only once.