public int findTwoBiggestDistinct(int[] arr) {
		if (arr.length < 2) {
			//no such numbers
			System.out.println("no such numbers");
			return arr[0];
		}
		
		
		int big1 = arr[0];
		int big2 = arr[1];	
		
		int i = 2;
		
		while (i < arr.length && big1 == big2) {
			big2 = arr[i];
			i++;
		}
		
		if (big1 != big2) {
			for (;i<arr.length;i++) {
				if (arr[i] > big1  && arr[i] != big2) {
					big1 = arr[i];
				} else if (arr[i] > big2 && arr[i] != big1)  {
					big2 = arr[i];
				}
			}
			System.out.println("big1: "+big1+" big2: "+big2);
		}  else {
			//no such numbers
			System.out.println("no such numbers");
		}
		
		
		
		return big1+big2;
		
	}