Why doesn't the additive constant in Big-O notation matter?

In definition of Big-O notation we care only about C coefficient:

f(n) ≤ Cg(n) for all n ≥ k

Why don't we care about A as well:

f(n) ≤ Cg(n) + A for all n ≥ k