If the code runs for n+n times, does the time complexity still constitute to be 2n?

Time complexity is measured in Big O notation. If code runs for n+n times, its complexity is still O(N).

If the code runs for n+n times, does the time complexity still constitute to be 2n?