Consider the "center" of the array of squares, as shown here:
f -------- g -------- X
| | |
| | |
| | |
| | |
X -------- c -------- d -------- e
| | |
| | |
| | |
| | |
X -------- a -------- b
vertex # of paths to that vertex
----------------------------------------
a C(19,0) = 1
b C(20,0) = 1
c C(19,1) = 19
d = b+c = 1+19 = 20
e = d = 20
f = c = 19
g = d+f = 39
Any SF path passes through exactly one of vertices e and g.
# paths g to F: C(19,0) = 1
# paths e to F: C(18,1) = 18
# paths S to F: 39*1 (through g) plus 20*18 (through e) = 39+360 = 399
ANSWER: 399 SF paths