Double Pair Array

easy

Hashmap and Heaps

Question Solve Solutions

1. Given an array of integers A with even length, return true if and only if it is possible to reorder it such that A[2 * i + 1] = 2 * A[2 * i] for every 0 <= i < len(A) / 2.

Input Format

First line contains 'N' size of the array Second line contains N space separated integer values

Output Format

A boolean value

Constraints

0 <= A.length <= 30000
    A.length is even
    -100000 <= A[i] <= 100000

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

4
2 1 2 6

Output

false

Subdomain Visit Count

Related Questions

easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String medium Smallest Substring Of A String Containing All Unique Characters Of Itself