Prove $\vdash \neg \neg A \leftrightarrow A$ in intuitionistic logic

Question

I want to prove $\vdash \neg \neg A \leftrightarrow A$ without using $RAA$ and $\bot$ rules. the part that $\vdash A \to \neg \neg A$ is simple but I can't prove the other part. is there any possibility for proving $\vdash \neg \neg A \to A$ without using $RAA$ and $\bot$ rule in natural deduction?