We consider Subtraction Nim, where two players have exactly the same options, but which is partizan in the sense that at the game ending, a partizan rule is applied for the decision of the winner. We consider the following example: Let $S$ be the set of removable numbers, which is a non-empty finite subset of positive integers greater than or equal to $2$, applied for both players Left and Right. At the end of the game, Left wins if the number of remaining tokens is even, and Right wins if the number of remaining tokens is odd. We computed the outcomes for many $S$, and found surprising phenomena that in most examples of $S$ (almost $98\%$ of some samples), the outcomes are $\mathcal{L}$-positions for all large enough $n$. In comparison, $\mathcal{R}$-positions appear only occasionally. The main theorem explains why this phenomenon occurs. We prove that $n+1$ and $n-1$ are $\mathcal{L}$-positions when $n$ is an $\mathcal{R}$-position. Similarly, $\mathcal{L}$-positions appear whenever $\mathcal{P}$-positions or $\mathcal{N}$-positions appear. Only $\mathcal{L}$-positions can last forever.