int sum(int a[], int n) {
	int sum = 0;
	for (int i = 0; i < n; i ++) {
		sum += a[i];
	}
	return sum;
}

bool find(int a[], int n, int x) {
	for (int i = 0; i < n; i ++) {
		if (a[i] == x) {
			return true;
		}
	}
	return false;
}

// 1 1 2 2 2 3
int duplicates(int a[], int n) {
	int count = 0;
	for (int i = 0; i < n; i ++) {
		for (int j = 0; j < i; j ++) {
			if (a[i] == a[j]) {
				count ++;
			}
		}
	}
	return count;
}

double squareRoot(double x) {
	// X > 1
	const int EPS = 0.1;
	double left = 0, right = x;
	int t = 0;
	while ((right - left) > EPS) {
		t ++;
		double mid = (left + right) / 2;
		if (mid * mid <= x) {
			left = mid;
		} else {
			right = mid;
		}
	}
	return left;
}

double sumOfSquareRoots(double a[], int n) {
	double sum = 0.0;
	for (int i = 0; i < n; i ++) {
		sum += squareRoot(a[i]);
	}
	return sum;
}