Graphs and Binary relations. Help with martix multiplication.

I need a refresher course on how to multiply boolean matrices. Say I have a graph with a corresponding adjacency matrix of:

A=

0 1 0 0 0

0 0 1 0 0

1 0 0 1 0

0 0 0 0 0

1 0 1 0 0

How do I find A(2), A(3) and so on until you get get A(5) or the reachability matrix? I know how to do it using Warshall's method but I need to do it by Boolean matrix multiplication. All I remember is you write a copy of the matrix next to itself and compare the first row with the first column or something like that. Can anyone help?