IRONCROSS

package practice.programpractice;
import java.util.Scanner;
public class ironCross {
    //Author Zunder Jacob A. Pacis BSIT102
    static void cross(int block) {
         int last = block - 1;
         int mid = (block - 1) / 2;
         //thickness algo
         int thicc = (((mid - 1) / 2)-1 / 2) /2;
         if (thicc%2==0) {
       thicc-=1;
    }
    int mdtc = thicc / 2;
        for (int i = 0; i < block; i++) {
        for (int j = 0; j < block; j++) {
            //logic conditions
            if (i <= mid + mdtc && i >= mid - mdtc ||
                j <= mid + mdtc && j >= mid - mdtc ||
                i < mid && j < thicc ||
                j > mid && i < thicc ||
                j < mid && i > last - thicc ||
                i > mid && j > last - thicc) {
            System.out.print(" * ");
            }
            else {
                System.out.print("   ");
            }
        }
        System.out.println();
    }
        System.out.println(mid + "\n" + thicc + "\n" + mdtc);
    }
    public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

    int block = sc.nextInt();
    if (block%2==0)
        block+=1;
    if (block<11)
        block=11;

    cross(block);
    }