Two Sum

Given an array of integers and a target sum, find two numbers that add up to the target. Return the indices (0-based) of the two numbers. Assume exactly one solution exists and you may not use the same element twice. Example: nums=[2,7,11,15], target=9 → nums[0]+nums[1]=2+7=9 → Output: '0 1'

Input

Line 1: n (array size). Line 2: n space-separated integers. Line 3: target.

Output

Two space-separated indices (0-based, smaller first).

Sample

4
2 7 11 15
9

Expected

0 1