What is the worst-case complexity of the following function?

int findEven (int a[], int n) { int i = 0; while (i < n && (a[i] %2 != 0)) { i++; } return i;