It is O(n), here's why:
The inner loop is executed N times (where N is "someNumber" in your code). It, of course, causes 4 executions. This does NOT mean that your program is O(n) + 4, as you suggested (that is not proper syntax for big O notation anyway, you meant either O(n+4) or O(n) + O(4)). It means your program is O(4*n). When one loop is nested in another, you multiply the two bounds of those loops. That is, if the outer loop goes till M and the inner loop goes till N, the big O will be O(M*N) as long as there is no other tricky code. So in this case, you multiply n by 4.
Then the rule of constant multiplication applies. 4 is a constant, so O(n*4) simplifies to O(n).