Transposed, primes, oh my! The task is simple: your program reads an integer as an input, and prints whether it is a prime or not. You can print &quot;yes/no&quot;, &quot;true/false&quot; or anything what unambiguously identifies the result.
The challenge is, the code has to work with its rows and columns transposed.
To exclude the obvious solution (shortest &quot;simple&quot; solution repeated vertically char-by-char with the use of comments), the metric is a little bit different from the usual code-golf:
Because formatting is very important in this challenge, the code size is measured in the area of the smallest rectangle the code fits in. In other words, whitespace does count, and the lines should be filled to be of equal length (you don't have to actually do it when you post the solution, for simplicity's sake). For example
int main()   
{            
    return 0;
}            

would have a size of 4*13 = 52, (and obviously it does not fit either of the two criteria: prime detection and transposable.)
Smallest size wins.
You can use any language, and any library function except if the sole purpose of that function is to find, generate, or detect primes.
Edit:
While the winner would probably be the Golfscript solution, I'll award a 50 point bounty for the best C or C++ solution!
C, 2*70 2*60

Prints y for primes, nothing otherwise.
EDIT: Changed code to save 10 chars. Must be run without paramters (so m=1).

main(m,n){for(scanf("%d",&amp;n);n%++m&amp;&amp;n&gt;1;);n-m||puts("y");}/*
\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\*/ 


The method for handling the transposition is quite generic, and can be applied to any program.
It's based on converting this:

abcd/*
\\\\*/


To this:

a\
b\
c\
d\
/*
*/


And both mean simply abcd.