Counting bubbles between an ADD and its consumer

In a classic 5-stage pipeline with full forwarding (bypass paths from the EX/MEM and MEM/WB pipeline latches directly into the ALU's input muxes), how many stall cycles are required to correctly execute this back-to-back register dependency?

ADD R1, R2, R3   ; R1 = R2 + R3
SUB R4, R1, R5   ; R4 = R1 - R5  (needs R1 the very next instruction)

2 of 47 in Computer Architecture