In an algorithm like this: (F R U') (R' U' R U) (R' F') (R U R' U') (R' F R F'), how would one fingertrick the F-primes? I feel this is a good example algorithm because it has an F' inside and at the end. I can perform the closing F' pretty well, but after practicing the perm about 100 times, I just can't figure out how to keep a good flow during the inner F'. Thanks.