To check whether a given string is Palindrome or not if not, check whether any of its 'ANAGRAM' is Palindrome or not with a complexity of O(N)

Palindrome_Anagram

import java.io.*;
import java.util.*;
class palin_anagram
{
void str(String s)
{
 char ch[]=s.toCharArray();
 Arrays.sort(ch);
 int l=s.length();
 if(l%2==0)
 evn(ch);
 else
 odd(ch);
}
void evn(char ch[])
{ int c=1;
for(int i=1; i<ch.length; i++)
{if(ch[i-1]==ch[i])
 c++;
 else if(c%2!=0)
 {System.out.println("Not-Palindrome"); System.exit(0);}
 else if(c%2==0)
 c=1;
 }
 System.out.println("Palindrome");
}
void odd(char ch[])
{ int c=1,x=0;
for(int i=1; i<ch.length; i++)
{if(ch[i-1]==ch[i])
 c++;
 else if(c%2!=0)
 x++;
 else if(x>=2)
 {System.out.println("Not-Palindrome"); System.exit(0);}
 else if(c%2==0)
 c=1;
 }
 System.out.println("Palindrome");
}
}
class ana
{public static void main(String [] args)throws IOException
 { BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
     palin_anagram d=new palin_anagram();
     String s=in.readLine();
     d.str(s);
    }
}