// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in Java SE 8
    }
}

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
		int N = A.length;
		if(0 == N) return 0;

		quickSort(A, 0, N-1);
		int distinctNum = 1;
		for (int i=1; i<N; i++){
			if(0 != (A[i -1] ^ A[i])) distinctNum++;
		}
		return distinctNum;
	}

	public void quickSort(int[] arr, int begin, int end) {
		int middle = (begin + end) / 2;
		int pivot = arr[middle];
		int left = begin;
		int right = end;
		int temp;

		while (left < right) { //left와 right가 만나면 루프 종료
			while (arr[left] < pivot) left++;       //left : pivot 값 보다 큰 값을 찾기 위해 이동
			while (arr[right] > pivot) right--;     //right : pivot 값 보다 작은 값을 찾기 위해 이동

			if (left <= right) { //left가 right보다 같거나 작으면 서로 값 교환해줌
				temp = arr[left];
				arr[left] = arr[right];
				arr[right] = temp;
				left++;
				right--;
			}
		}
		//부분 분할 실행
		if (begin < right) quickSort(arr, begin, right);
		if (end > left) quickSort(arr, left, end);
	}
}

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
		int N = A.length;
		if(0 == N) return 0;

		quickSort(A, 0, N-1);
		int distinctNum = 1;
		for (int i=1; i<N; i++){
			if(0 != (A[i -1] ^ A[i])) distinctNum++;
		}
		return distinctNum;
	}

	public void quickSort(int[] arr, int begin, int end) {
		int middle = (begin + end) / 2;
		int pivot = arr[middle];
		int left = begin;
		int right = end;
		int temp;

		while (left < right) { //left와 right가 만나면 루프 종료
			while (arr[left] < pivot) left++;       //left : pivot 값 보다 큰 값을 찾기 위해 이동
			while (arr[right] > pivot) right--;     //right : pivot 값 보다 작은 값을 찾기 위해 이동

			if (left <= right) { //left가 right보다 같거나 작으면 서로 값 교환해줌
				temp = arr[left];
				arr[left] = arr[right];
				arr[right] = temp;
				left++;
				right--;
			}
		}
		//부분 분할 실행
		if (begin < right) quickSort(arr, begin, right);
		if (end > left) quickSort(arr, left, end);
	}
}

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
		int N = A.length;
		if(0 == N) return 0;

		quickSort(A, 0, N-1);
		int distinctNum = 1;
		for (int i=1; i<N; i++){
			if(0 != (A[i -1] ^ A[i])) distinctNum++;
		}
		return distinctNum;
	}

	public void quickSort(int[] arr, int begin, int end) {
		int middle = (begin + end) / 2;
		int pivot = arr[middle];
		int left = begin;
		int right = end;
		int temp;

		while (left < right) { //left와 right가 만나면 루프 종료
			while (arr[left] < pivot) left++;       //left : pivot 값 보다 큰 값을 찾기 위해 이동
			while (arr[right] > pivot) right--;     //right : pivot 값 보다 작은 값을 찾기 위해 이동

			if (left <= right) { //left가 right보다 같거나 작으면 서로 값 교환해줌
				temp = arr[left];
				arr[left] = arr[right];
				arr[right] = temp;
				left++;
				right--;
			}
		}
		//부분 분할 실행
		if (begin < right) quickSort(arr, begin, right);
		if (end > left) quickSort(arr, left, end);
	}
}