The problem has innate $\rm\color{#c00}{symmetry}$ that greatly simplifies matters once brought to the fore.
$$\begin{align} 2009-1982 = 27,\quad 2009-1972 = 37\\
1972-1945 = 27,\quad 1982-1945 = 37\end{align}$$
Thus $\phantom{\Rightarrow}\ \ \{ 2009,\ \ \ 1945\}\ \ \equiv\, \{1982,\ \ \ 1972\}\ \ \ \ {\rm mod}\,\ 27\ \&\ 37,\ $
$\qquad\Rightarrow\ \{2009^n,\ \ 1945^n\} \equiv \{1982^n,\ \,1972^n\}\,\ {\rm mod}\,\ 27 \ \&\ 27,\ $ by the Congruence Power Rule
$\qquad\Rightarrow\ \ \ 2009^n\!+\! 1945^n\ \ \equiv \ \, 1982^n\!+1972^n\ \ \ {\rm mod}\,\ 27\ \&\ 37,\ $ so also $\,{\rm mod}\ 999 = {\rm lcm}(27,37)$
since addition $\,f(x,y)\, =\, x + y\ $ is $\rm\color{#c00}{symmetric}$ $\,f(x,y)= f(y,x),\, $ therefore its value depends only upon the (multi-)set $\,\{x,\ y\}.\, $ Parity $\,\Rightarrow\,$ congruent mod $2,\,$ so also mod $\,2\cdot 999 = 1998.$
Remark $ $ Generally if a polynomial $\,f\in\Bbb Z[x,y]\,$ is $\rm\color{#c00}{symmetric}$ then as above we deduce
$\qquad\qquad\quad \{A, B\}\, \equiv\, \{a,b\}\,\ {\rm mod}\,\ m\ \&\ n\ \Rightarrow\ f(A,B)\equiv f(a,b)\, \bmod{\,{\rm lcm}(m,n)}$
a generalization of CCRT =constant-case optimization of CRT = Chinese Remainder, plus a generalization of the Polynomial Congruence Rule to (symmetric) bivariate polynomials.