// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int N) {
        // write your code in Java SE 8
    }
}

import java.util.*;

class Solution {
    public int solution(int N) {
        int cnt = 0;
            int sq = (int)Math.sqrt(N);
            for(int i=1; i<=sq; i++){
                if(N%i == 0){
                    cnt++;
                }
            }
            
            cnt*=2;
            if(sq * sq == N){
                cnt--;
            }
        
        return cnt;
    }
}

import java.util.*;

class Solution {
    public int solution(int N) {
     int cnt = 0;
        int sq = (int)Math.sqrt(N);
           for(int i=1; i<=sq; i++){
            if(N%i == 0){
                cnt++;
            }
        }
        
        cnt*=2;
        if(sq * sq == N){
            cnt--;
    }
    
        return cnt;
    }
}

import java.util.*;

class Solution {
    public int solution(int N) {
     int cnt = 0;
        int sq = (int)Math.sqrt(N);
           for(int i=1; i<=sq; i++){
            if(N%i == 0){
                cnt++;
            }
        }
        
        cnt*=2;
        if(sq * sq == N){
            cnt--;
    }
    
        return cnt;
    }
}

import java.util.*;

class Solution {
    public int solution(int N) {
     int cnt = 0;
     int m
        int sq = (int)Math.sqrt(N);
           for(int i=1; i<=sq; i++){
            if(N%i == 0){
                cnt++;
            }
        }
        
        cnt*=2;
        if(sq * sq == N){
            cnt--;
    }
    
        return cnt;
    }
}

import java.util.*;

class Solution {
    public int solution(int N) {
     int cnt = 0;
     int min = Int.
        int sq = (int)Math.sqrt(N);
           for(int i=1; i<=sq; i++){
            if(N%i == 0){
                cnt++;
            }
        }
        
        cnt*=2;
        if(sq * sq == N){
            cnt--;
    }
    
        return cnt;
    }
}

import java.util.*;

class Solution {
    public int solution(int N) {
     int cnt = 0;
     int min = Integer.MAX_VALUE;
        int sq = (int)Math.sqrt(N);
           for(int i=1; i<=sq; i++){
            if(N%i == 0){
                cnt++;
            }
        }
        
        cnt*=2;
        if(sq * sq == N){
            cnt--;
    }
    
        return cnt;
    }
}

import java.util.*;

class Solution {
    public int solution(int N) {
     int cnt = 0;
     int min = Integer.MAX_VALUE;
        int sq = (int)Math.sqrt(N);
           for(int i=1; i<=sq; i++){
            if(N%i == 0){
                if(i * (N/i)){
                    
                }
            }
        }
        
        cnt*=2;
        if(sq * sq == N){
            cnt--;
    }
    
        return cnt;
    }
}

import java.util.*;

class Solution {
    public int solution(int N) {
     int cnt = 0;
     int min = Integer.MAX_VALUE;
        int sq = (int)Math.sqrt(N);
           for(int i=1; i<=sq; i++){
            if(N%i == 0){
                if(i * (N/i) < min){
                    
                }
            }
        }
        
        cnt*=2;
        if(sq * sq == N){
            cnt--;
    }
    
        return cnt;
    }
}

import java.util.*;

class Solution {
    public int solution(int N) {
     int cnt = 0;
     int min = Integer.MAX_VALUE;
        int sq = (int)Math.sqrt(N);
           for(int i=1; i<=sq; i++){
            if(N%i == 0){
                if((i + (N/i)) * 2 < min){
                    min = 
                }
            }
        }
        
        cnt*=2;
        if(sq * sq == N){
            cnt--;
    }
    
        return cnt;
    }
}

import java.util.*;

class Solution {
    public int solution(int N) {
     int cnt = 0;
     int min = Integer.MAX_VALUE;
        int sq = (int)Math.sqrt(N);
           for(int i=1; i<=sq; i++){
            if(N%i == 0){
                if((i + (N/i)) * 2 < min){
                    min =(i + (N/i)) * 2;
                }
            }
        }
        
        cnt*=2;
        if(sq * sq == N){
            cnt--;
    }
    
        return cnt;
    }
}

import java.util.*;

class Solution {
    public int solution(int N) {
    int cnt = 0;
    int min = Integer.MAX_VALUE;
    int sq = (int)Math.sqrt(N);
       for(int i=1; i<=sq; i++){
        if(N%i == 0){
            if((i + (N/i)) * 2 < min){
                min =(i + (N/i)) * 2;
            }
        }
    }
        
        cnt*=2;
        if(sq * sq == N){
            cnt--;
    }
    
        return cnt;
    }
}

import java.util.*;

class Solution {
    public int solution(int N) {
    int cnt = 0;
    int min = Integer.MAX_VALUE;
    int sq = (int)Math.sqrt(N);
    for(int i=1; i<=sq; i++){
    if(N%i == 0){
        if((i + (N/i)) * 2 < min){
            min =(i + (N/i)) * 2;
        }
    }
}
        
        cnt*=2;
        if(sq * sq == N){
            cnt--;
    }
    
        return cnt;
    }
}

import java.util.*;

class Solution {
    public int solution(int N) {
    int cnt = 0;
    int min = Integer.MAX_VALUE;
    int sq = (int)Math.sqrt(N);
    for(int i=1; i<=sq; i++){
        if(N%i == 0){
            if((i + (N/i)) * 2 < min){
                min =(i + (N/i)) * 2;
            }
        }
    }
        
    cnt*=2;
    if(sq * sq == N){
        cnt--;
    }
    
        return cnt;
    }
}

import java.util.*;

class Solution {
    public int solution(int N) {
        int cnt = 0;
        int min = Integer.MAX_VALUE;
        int sq = (int)Math.sqrt(N);
        for(int i=1; i<=sq; i++){
            if(N%i == 0){
                if((i + (N/i)) * 2 < min){
                    min =(i + (N/i)) * 2;
                }
            }
        }
        
        return min;
    }
}

import java.util.*;

class Solution {
    public int solution(int N) {
        int cnt = 0;
        int min = Integer.MAX_VALUE;
        int sq = (int)Math.sqrt(N);
        for(int i=1; i<=sq; i++){
            if(N%i == 0){
                if((i + (N/i)) * 2 < min){
                    min =(i + (N/i)) * 2;
                }
            }
        }
        
        return min;
    }
}

import java.util.*;

class Solution {
    public int solution(int N) {
        int cnt = 0;
        int min = Integer.MAX_VALUE;
        int sq = (int)Math.sqrt(N);
        for(int i=1; i<=sq; i++){
            if(N%i == 0){
                if((i + (N/i)) * 2 < min){
                    min =(i + (N/i)) * 2;
                }
            }
        }
        
        return min;
    }
}